This arranges nodes into layers. The method uses a hierarchical approach for creating drawings of digraphs with nodes arranged in layers. The layout algorithm consists of four-major steps: Cycle Removal, Layer Assignment, Crossing Reduction, and Straightening and Packing.
Constructs a LayeredDigraphLayout with no Layout#network and with no owning Layout#diagram.
The faster, less aggressive, crossing reduction algorithm; a valid value for LayeredDigraphLayout#aggressiveOption.
The slower, more aggressive, crossing reduction algorithm, a valid value for LayeredDigraphLayout#aggressiveOption.
The fastest, but poorest, crossing reduction algorithm; a valid value for LayeredDigraphLayout#aggressiveOption.
Remove cycles using depth first cycle removal; a valid value of LayeredDigraphLayout#cycleRemoveOption.
Remove cycles using greedy cycle removal; a valid value of LayeredDigraphLayout#cycleRemoveOption.
Initialize using depth first in initialization; a valid value for LayeredDigraphLayout#initializeOption.
Initialize using depth first out initialization; a valid value for LayeredDigraphLayout#initializeOption.
Initialize using naive initialization; a valid value for LayeredDigraphLayout#initializeOption.
Assign layers using longest path sink layering; a valid value for LayeredDigraphLayout#layeringOption.
Assign layers using longest path source layering; a valid value for LayeredDigraphLayout#layeringOption.
Assign layers using optimal link length layering; A valid value for LayeredDigraphLayout#layeringOption.
Enable all options for the LayeredDigraphLayout#packOption property; See also LayeredDigraphLayout#PackExpand, LayeredDigraphLayout#PackStraighten, and LayeredDigraphLayout#PackMedian.
This option gives more chances for the packing algorithm to improve the network, but is very expensive in time for large networks; a valid value for LayeredDigraphLayout#packOption.
This option tries to have the packing algorithm center groups of nodes based on their relationships with nodes in other layers, a valid value for LayeredDigraphLayout#packOption.
Does minimal work in packing the nodes; a valid value for LayeredDigraphLayout#packOption.
This option tries to have the packing algorithm straighten many of the links that cross layers, a valid value for LayeredDigraphLayout#packOption.
Gets or sets which aggressive option is being used to look for link crossings.
Gets or sets the top-left point for where the graph should be positioned when laid out.
Gets or sets the size of each column.
Gets or set which cycle removal option is used.
Gets the Diagram that owns this layout, if it is the value of Diagram#layout.
Gets or sets the direction the graph grows towards.
Gets the Group that uses this layout, if it is the value of a group's Group#layout.
Gets or sets which indices initialization option is being used.
Gets or sets whether this layout is performed on an initial layout.
Gets or sets whether this layout can be invalidated by #invalidateLayout.
Gets or sets whether this layout be performed in real-time, before the end of a transaction.
Gets or sets whether this layout routes Links.
Gets or sets whether this layout needs to be performed again.
Gets or sets whether this layout depends on the Diagram#viewportBounds's size.
Gets or sets the number of iterations to be done.
Gets or sets the size of each layer.
Gets or sets which layering option is being used.
Gets the largest column value.
Gets the largest index value.
Gets the larges index layer.
Gets the largest layer value.
Gets the smallest index layer.
Gets or sets the LayoutNetwork used by this Layout, if any.
Gets or sets the options used by the straighten and pack function, The default value is LayeredDigraphLayout#PackAll.
Gets or sets whether the FromSpot and ToSpot of each link should be set to values appropriate for the given value of LayeredDigraphLayout#direction.
Assigns every vertex in the input network to a layer.
any
Updates the physical location of "real" nodes and links to reflect the layout.
any
Routes the links.
any
Lays out the nodes.
any
Creates a copy of this Layout and returns it.
Create a new LayoutNetwork of LayeredDigraphVertexes and LayeredDigraphEdges.
Assign the positions of the vertexes in the network.
A Diagram or a Group or a collection of Parts.
any
any
any
If #isOngoing is true and if an initial layout has not yet been performed, set the #isValidLayout property to false, and ask to perform another layout in the near future.
any
Create and initialize a LayoutNetwork with the given nodes and links.
A Diagram or a Group or a collection of Parts.
When using a LayoutNetwork, update the "physical" node positionings and link routings.
any