Constructs an internal node to represent the specified real graph cell
the real graph cell this node represents
The graph cell this object represents.
Collection of hierarchy edges that have this node as a source
Collection of hierarchy edges that have this node as a target
Assigns a unique hashcode for each node. Used by the model dfs instead of copying HashSets
The height of this cell. Default is 0.
The object identity of the wrapped cell
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
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 core vertex 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
Returns the integer value of the layer that this node resides in
Gets the value of x on the specified layer
/
Returns whether or not this cell is an edge
Returns true.
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