Constructs a hierarchy edge
a list of real graph edges this abstraction represents
The graph edge(s) this object represents. Parallel edges are all grouped together within one hierarchy edge.
The height of this cell. Default is 0.
The object identities of the wrapped cells
Whether or not the direction of this edge has been reversed internally to create a DAG for the hierarchical layout
The maximum rank this cell occupies. Default is -1.
The minimum rank this cell occupies. Default is -1.
A cached version of the cells this cell connects to on the next layer up
A cached version of the cells this cell connects to on the next layer down
The node this edge is sourced at
The node this edge targets
Temporary variable for general use. Generally, try to avoid carrying information between stages. Currently, the longest path layering sets temp to the rank position in fixRanks() and the crossing reduction uses this. This meant temp couldn't be used for hashing the nodes in the model dfs and so hashCode was created
The width of this cell. Default is 0.
The x position of this cell for each layer it occupies
The y position of this cell for each layer it occupies
Gets the first core edge associated with this wrapper
Gets the value of temp for the specified layer
Returns the cells this cell connects to on the next layer up
Returns the cells this cell connects to on the next layer down
Gets the value of x on the specified layer
Inverts the direction of this internal edge(s)
Returns true.
Returns whether or not this cell is a node
Set the value of temp for the specified layer
Set the value of x for the specified layer
Set the value of y for the specified layer
Generated using TypeDoc
An abstraction of a hierarchical edge for the hierarchy layout