the vertices for this hierarchy
whether or not to tighten vertices towards the sources
High value to start source layering scan rank value from.
Count of the number of times the ancestor dfs has been used.
Map from graph edges to internal model edges
Stores the largest rank number allocated
The parent cell whose children are being laid out
Mapping from rank number to actual rank
Store of roots of this hierarchy model, these are real graph cells, not internal cells
Whether or not to tighten the assigned ranks of vertices up towards the source cells.
Map from graph vertices to internal model nodes.
Creates all edges in the internal model
Performs a depth first search on the internal hierarchy model. This dfs extends the default version by keeping track of cells ancestors, but it should be only used when necessary because of it can be computationally intensive for deep searches.
Fixes the layer assignments to the values stored in the nodes. Also needs to create dummy nodes for edges that cross layers.
Basic determination of minimum layer ranking by working from from sources or sinks and working through each node in the relevant edge direction. Starting at the sinks is basically a longest path layering algorithm.
A depth first search through the internal heirarchy model.
Generated using TypeDoc
Internal model of a hierarchical graph. This model stores nodes and edges equivalent to the real graph nodes and edges, but also stores the rank of the cells, the order within the ranks and the new candidate locations of cells. The internal model also reverses edge direction were appropriate , ignores self-loop and groups parallels together under one edge object.