documentationfor yFiles for HTML 3.0.0.3

Usages of LayoutStageBase

Extending Types

GenericLabelingA generic labeling algorithm for placing the labels of a graph.
AlignmentStageAlignmentStage places the nodes of the given layout on automatically determined horizontal and/or vertical lines.
BendSubstitutionStageBendSubstitutionStage replaces edge bends with proxy nodes for the coreLayout.
ComponentLayoutRepresents a layout algorithm that arranges the connected components of a graph, allowing for the use of different layout styles and customization for component and edge arrangement.
ContextModificationStageTemporarily modifies the LayoutGraphContext for the following layout algorithms.
CurveFittingStageCurveFittingStage fits a piecewise cubic Bezier curve to given arbitrary edge paths.
GenericLayoutGridStageThis stage offers generic support for LayoutGrid structures so that a grid can be considered even when running a layout algorithm that natively does not support it.
GivenCoordinatesLayoutGivenCoordinatesLayout changes node locations and sizes as well as edge paths to user-specified values before invoking the coreLayout.
GroupHidingStageAn ILayoutStage that hides the group nodes of hierarchically grouped graphs.
LayoutAnchoringStageLayoutAnchoringStage anchors the graph on an initial position based on either a single graph item or the alignment of the bounds of several items (but not the positions of the individual items).
LineWrappingStageLineWrappingStage can line-wrap or column-wrap a graph layout.
MinimumNodeSizeStageMinimumNodeSizeStage enforces a given minimum width/height of the nodes of a graph during the layout process.
OrientationStageOrientationStage is an ILayoutStage that changes the orientation of the layout.
PlaceNodesAtBarycenterStagePlaceNodesAtBarycenterStage temporarily hides the affectedNodes, 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.
PortPlacementStageThe PortPlacementStage assigns edges to the ports specified by LayoutPortCandidates or NodePortCandidates after calling the coreLayout.
RecursiveGroupLayoutThis 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.
RemoveCollinearBendsStageThe RemoveCollinearBendsStage removes all collinear bends found in a graph.
RemoveOverlapsStageThis ILayoutStage removes node overlaps and guarantees a certain minimum distance between nodes.
ReverseEdgesStageReverseEdgesStage 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.
SubgraphLayoutStageA SubgraphLayoutStage is an ILayoutStage that filters out all graph elements that are not part of a specific subgraph.
TemporaryGroupInsertionStageTemporaryGroupInsertionStage 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.
MultiPageLayoutThis layout algorithm subdivides the input graph into several LayoutGraphs (called page graphs) such that the layout (calculated by the specified coreLayout) of each graph fits the maximumPageSize.
PartialLayoutThis class represents a partial layout algorithm which changes the coordinates for a given set of graph elements (called partial elements) only.
BundledEdgeRouterAn ILayoutStage that bundles the edges of general undirected graphs to avoid visual cluttering.
CurveRoutingStageCurveRoutingStage replaces polyline edge paths with curved segments using cubic bezier splines.
EdgeRouterThis edge routing algorithm applies orthogonal, octilinear or curved routes to the edges of the graph while not changing node positions.
OctilinearRoutingStageOctilinearRoutingStage creates octilinear edge routes by extending given orthogonal edge paths with polyline segments.
OrganicEdgeRouterThis edge routing algorithm applies organic routes to the edges of the graph.
ParallelEdgeRouterParallelEdgeRouter is an ILayoutStage that routes multi-edges, which connect the same pair of nodes, in a parallel fashion.
SelfLoopRouterA SelfLoopRouter routes the self-loops (reflexive edges) of a graph.
StraightLineEdgeRouterThis edge routing algorithm routes edges as straight lines considering the specified LayoutPortCandidates.
TreeReductionStageThe TreeReductionStage temporarily reduces general graphs to trees.