Partial LayoutStage implementation that handles the management of the core layouter part.

This layout stage replaces bends with dummy nodes, calls the core layout algorithm and recreates the bends.

A hull layouter that invokes another layout algorithm on a copy of its input graph.

An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it is passed to the core layout routine itself.

This layout stage arranges the connected components of a graph.

A layouter that allows to express a layout stage as a chain of more basic layout stages.

A composite layout stage that allows to express a layout stage as a chain of more basic layout stages.

This is a LayoutGraph implementation that serves as a copy of another LayoutGraph or as copy of a combined GraphInterface and and GraphLayout interface implementation.

This class is a default implementation of the EdgeLayout interface.

This class is a default implementation of the simple GraphLayout interface.

This class is a default implementation of the abstract class LayoutGraph.

This class is the default implementation for the NodeLabelLayout.

This class is a default implementation of the NodeLayout interface.

An edge label model that allows placement of labels at some positions along an edge.

A node label model that allows placement of labels at eight positions around a node and at nine positions inside the node.

A candidate position for edge labels

This class is an default implementation of the EdgeLabelLayout interface.

A node label model that sets the labels at the opposite side of the outgoing edges of a node.

A layout stage that can be used to (selectively) reverse edges in a graph while keeping the layout and label positions of the reversed edges as close to the pre-reversal layout and positions as possible.

Layout stage that can be used to fix the position of either a single node or the alignment of the bounding box of several nodes (but not the positions of the individual nodes).

An edge label model that allows placement of labels at a fixed offset from the source intersection point of the node.

The model parameters for the FreeEdgeLabelModel.

A node label model that allows placement of labels at a fixed offset relative to the node's upper-left corner.

The model parameter that encodes a node label position within FreeNodeLabelModel.

A layout stage that can be used to "line-wrap" or "column-wrap" a graph layout.

Base class for candidate positions for labels.

This class encapsulates layout data for a label.

A layout stage that improves the placement of edge labels.

This class is a default implementation of the LabelLayout interface.

This interface provides label-specific keys that can be used to add data providers to a layout graph.

Layout stage that automatically translates label layout information provided by the standard label layout classes IEdgeLabelLayout and INodeLabelLayout to layout data of type LabelLayoutData that is accessible by the keys defined in class LabelLayoutKeys .

Implements the ranking for edge and node labels for Graph2D.

This class represents a drawing of a graph.

An implementation of the copy factory interface used by GraphCopier that can be used by implementations of LayoutGraph .

An implementation of the copy factory interface used by GraphCopier that can be used by implementations of LayoutGraph that are hierarchically grouped using GroupingKeys .

This class delegates its layout calls to a core layout algorithm that is dynamically chosen at runtime by inspecting the nodes of the input graph.

This class is a container for several helper and utility functions for the LayoutGraph class.

This layout stage enforces a given minimum width/height of the nodes of a graph during the layout process.

This class represents a candidate position for label associated to a node in a graph.

This class is an default implementation of the NodeLabelLayout interface.

Layout stage that can be used to normalize the order of the elements within a graph.

A layout stage that performs changes the orientation of the layout that another algorithm calculates.

Class that provides a method for transferring a point to its final position.

A layout algorithm that routes parallel edges (edges that connect the same pair of nodes) of a graph.

This layout stage provides a framework for layouts that are based on a divide and conquer approach.

InterEdgeRouter implementation that routes inter-edges using ChannelEdgeRouter .

PartitionPlacer implementation that uses ComponentLayouter to place the partitions.

PartitionFinder implementation that uses EdgeBetweennessClustering(Graph, INodeMap, Boolean, Int32, Int32, IDataProvider) as partition strategy.

InterEdgeRouter implementation that routes inter-edges using OrthogonalEdgeRouter .

This class implements a LayoutStage that can be used to adjust the final port assignments after a layout has been calculated.

This class represents a candidate for an edge's ports.

This class describes a set of possible PortCandidate s and their cardinality for a node-like entity.

This class represents a constraint for either a source or target port of an edge.

Provides configuration services for the port constraints of a graph.

This layout stage can be used to enforce that a layout algorithm will not change the relative coordinates of ports that are associated with a strong/fixed port constraint.

This interface defines keys used to associate DataProviders that provide port constraints for all edges of the input graph.

This LayoutStage removes all collinear bends found in the graph.

An rotated edge label model that allows placement of rotated labels at some positions along an edge.

An edge label model that allows placement of labels at a set of continuous positions along both sides of an edge or directly on the edge path.

A layout algorithm that routes the self-loops (reflexive edges) of a graph.

This Layouter will take several ILayouter implementations and will run these layout algorithms one after the other in the order in which they were added.

An edge label model that allows placement of labels at a set of continuous positions along both sides of an edge or directly on the edge path.

Encodes the model parameters for the two slider edge label models specified by Center and Side .

A layout stage that filters out all graph elements that are not part of a subgraph that is induced by the selected nodes of the input graph.

Helper class for swimlanes.

Class that internally represents a swim lane.

This interface defines the properties of one edge label from the perspective of a labeling algorithm.

This interface defines the properties of the model associated with an edge label layout.

This interface encapsulates the layout information for an edge.

This interface defines the layout information of a graph.

Interface implemented by classes that are responsible for calculating the intersection point between an Edge and the visual representation of its source or target node.

This interface defines the properties of one label from the perspective of a labeling algorithm.

This is a general interface for algorithms that perform a layout process on a given layout graph.

Interface for a layouter that forms a stage of a larger layout process.

This interface defines the properties of one edge label from the perspective of a labeling algorithm.

This interface defines the properties of the model associated with a node label layout.

This interface describes the layout information for a node in the drawing of a graph.

This is an interface for ranking LabelCandidates.

Implementations of this interface are responsible for routing inter-edges.

Implementations of this interface are responsible to partition the input graph.

Implementations of this interface are responsible for arranging the graph partitions.

The interface that is used by PortCandidateSet to retrieve PortCandidate s from.

An interface that is returned by the find methods in PortCandidateSet..::..ICandidateMatcher and the Entries method.

Edge flow specifier used by method DetermineEdgeFlowDirection(LayoutGraph, IDataProvider) .

Fix point calculation policy that results in the center of a given rectangle to be considered the fix point.

Orientation specifier.

Weak constraint specifier.

Symbolic slider mode specifier.

Constant which can be used for ArrangeRectangleRows(array<Rectangle2D>[]()[][], Rectangle2D, Double, RowAlignment) .

Edge layout style modifier.

Symbolic slider mode specifier.

Symbolic ratio specifier.

Swim lane ordering mode specifier.