Usages of LayoutStageBase
Extending Types
| PartitionGridLayoutStage | This class implements a layout stage that handles a given partition grid structure. | |
| TopLevelGroupToSwimlaneStage | This layout stage can be used for automatically assigning SwimlaneDescriptor instances to nodes by treating top-level group nodes as swimlanes. | |
| LabelingBase | An abstract base class for generic labeling algorithms which place labels of graphs. | |
| AlignmentStage | AlignmentStage places the nodes of the given layout on automatically determined horizontal and/or vertical lines. | |
| BufferedLayout | A BufferedLayout is a hull algorithm that invokes its core layout algorithm on a copy of the input graph. | |
| ComponentLayout | A ComponentLayout arranges the connected components of a graph. | |
| CompositeLayoutStage | CompositeLayoutStage allows for combining multiple ILayoutStages. | |
| CurveFittingLayoutStage | CurveFittingLayoutStage fits a piecewise cubic bezier curve to given arbitrary edge paths. | |
| FixGroupLayoutStage | A layout stage that can handle fixed nodes in hierarchically grouped graphs. | |
| FixNodeLayoutStage | FixNodeLayoutStage fixes the initial position of either a single node or the alignment of the bounding box of several nodes (but not the positions of the individual nodes). | |
| FixPortLocationStage | FixPortLocationStage ensures that layout algorithms that cannot handle port constraints keep the ports of edges with strong PortConstraints. | |
| GenericPartitionGridStage | This ILayoutStage offers generic support for partition grid structures. | |
| GivenCoordinatesStage | GivenCoordinatesStage changes node locations and sizes as well as edge paths to user-specified values before invoking the core layout algorithm. | |
| GraphLayoutLineWrapper | GraphLayoutLineWrapper can line-wrap or column-wrap a graph layout. | |
| HandleNaNCoordinatesStage | A ILayoutStage that temporarily removes all nodes and edges with NaN-coordinates. | |
| HideGroupsStage | A layout stage that hides the group nodes of hierarchically grouped graphs. | |
| LayoutMultiplexer | A LayoutMultiplexer delegates its layout calls to a core layout algorithm that is dynamically chosen at runtime by inspecting the nodes of the input graph. | |
| MinimumNodeSizeStage | MinimumNodeSizeStage enforces a given minimum width/height of the nodes of a graph during the layout process. | |
| NormalizeGraphElementOrderStage | NormalizeGraphElementOrderStage normalizes the order of the elements within a graph to ensure the same order for multiple layout invocations. | |
| OrientationLayout | OrientationLayout is a ILayoutStage that changes the orientation of the layout. | |
| PartitionLayout | PartitionLayout provides a framework for layouts that are based on a divide and conquer approach. | |
| PlaceNodesAtBarycenterStage | PlaceNodesAtBarycenterStage temporarily hides the affected nodes, applies the specified core layout algorithm (if any) to the resulting graph and, finally, reinserts the hidden nodes by placing them on the barycenter of their neighbors using the specified node sizes. | |
| PortCalculator | A PortCalculator can be applied to move ports from the nodes' rectangular bounds to the actual outline. | |
| PortPlacementStage | The PortPlacementStage assigns edges to the ports specified by PortConstraints or PortCandidates after calling the core layout algorithm. | |
| RecursiveGroupLayout | This layout algorithm recursively traverses a hierarchically organized graph in a bottom-up fashion and applies a specified layout algorithm to the contents (direct children) of each group node. | |
| RemoveCollinearBendsStage | The RemoveCollinearBendsStage removes all collinear bends found in a graph. | |
| ReverseEdgesStage | ReverseEdgesStage selectively reverses 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. | |
| SelfLoopRouter | A SelfLoopRouter routes the self-loops (reflexive edges) of a graph. | |
| SubgraphLayout | A SubgraphLayout is a ILayoutStage that filters out all graph elements that are not part of a specific subgraph. | |
| TemporaryGroupNodeInsertionStage | TemporaryGroupNodeInsertionStage is useful if nodes should be treated by layout algorithms as if they were actually grouped without the need to manually create a grouped graph for the layout process. | |
| MultiPageLayout | This layout algorithm subdivides the input graph into several LayoutGraphs (called page graphs) such that the layout (calculated by the specified core layout algorithm) of each graph fits the specified maximum page size. | |
| OrganicPartitionGridLayoutStage | This layout stage enables support for handling a graph with a PartitionGrid structure. | |
| OrganicRemoveOverlapsStage | This layout stage removes node overlaps while changes to the original layout structure are avoided and a specified minimum node distance is guaranteed. | |
| RecursiveShuffleLayout | This algorithm recursively removes node overlaps from a graph with a hierarchic group structure. | |
| PartialLayout | This class represents a partial layout algorithm which changes the coordinates for a given set of graph elements (called partial elements) only. | |
| BusRouter | An edge routing algorithm which routes edges of a graph in an orthogonal bus-style. | |
| ChannelEdgeRouter | This edge routing algorithm generates orthogonal routes for the edges of the graph. | |
| CurveRoutingStage | CurveRoutingStage replaces polyline edge paths with curved segments using cubic bezier splines. | |
| EdgeBundlingStage | A ILayoutStage that bundles the edges of general undirected graphs to avoid visual cluttering. | |
| EdgeRouter | This edge routing algorithm applies polyline routes to the edges of the graph. | |
| OrthogonalPatternEdgeRouter | OrthogonalPatternEdgeRouter routes edges orthogonally such that the resulting layout of the edges consists only of vertical and horizontal segments. | |
| OrthogonalSegmentDistributionStage | OrthogonalSegmentDistributionStage distributes overlapping edge segments of orthogonally routed edges. | |
| ParallelEdgeRouter | ParallelEdgeRouter is a ILayoutStage that routes parallel edges which connect the same pair of nodes in a graph. | |
| PolylineLayoutStage | PolylineLayoutStage extends the orthogonal edge paths with polyline segments. | |
| SnapOuterPortsToNodeBorderStage | SnapOuterPortsToNodeBorderStage moves edge ports that are outside the corresponding area of the nodes to their border. | |
| StraightLineEdgeRouter | This edge routing algorithm routes edges as straight-lines considering the specified PortConstraints. | |
| TreeReductionStage | The TreeReductionStage temporarily reduces general graphs to trees. |