The total number of crossings found in the best configuration so far
The total number of crossings found in the best configuration so far
Reference to the enclosing
The maximum number of iterations to perform whilst reducing edge crossings. Default is 24.
The total number of crossings found in the best configuration so far
Stores each rank as a collection of cells in the best order found for each layer so far
Calculates the total number of edge crossing in the current graph. Returns the current number of edge crossings in the hierarchy graph model in the current candidate layout
the internal model describing the hierarchy
Calculates the number of edges crossings between the specified rank and the rank below it. Returns the number of edges crossings with the rank beneath
the topmost rank of the pair ( higher rank value )
the internal model describing the hierarchy
Performs a vertex ordering within ranks as described by Gansner et al 1993
Attempts to minimise the median placement of connected cells on this rank and one of the adjacent ranks
the layer number of this rank
whether or not this is a downward sweep through the graph
Calculates the median rank order positioning for the specified cell using the connected cells on the specified rank. Returns the median rank ordering value of the connected cells
the cells on the specified rank connected to the specified cell
the rank that the connected cell lie upon
Takes each possible adjacent cell pair on each rank and checks if swapping them around reduces the number of crossing
the iteration number of the main loop
the internal model describing the hierarchy
Sweeps up or down the layout attempting to minimise the median placement of connected cells on adjacent ranks
the iteration number of the main loop
the internal model describing the hierarchy
Sets the horizontal locations of node and edge dummy nodes on each layer. Uses median down and up weightings as well heuristic to straighten edges as far as possible.