Class MedianHybridCrossingReduction

constructor

• new MedianHybridCrossingReduction(layout): MedianHybridCrossingReduction

• Parameters

  • layout: HierarchicalLayout | SwimlaneLayout

  Returns MedianHybridCrossingReduction

currentBestCrossings

iterationsWithoutImprovement

layout

maxIterations

maxNoImprovementIterations

nestedBestRanks

calculateCrossings

• calculateCrossings(model): number

• 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

  Parameters

  • model: GraphHierarchyModel

    the internal model describing the hierarchy

  Returns number

calculateRankCrossing

• calculateRankCrossing(i, model): number

• 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

  Parameters

  • i: number

    the topmost rank of the pair ( higher rank value )
  • model: GraphHierarchyModel

    the internal model describing the hierarchy

  Returns number

execute

• execute(parent): void

• Performs a vertex ordering within ranks as described by Gansner et al 1993

  Parameters

  • parent: any

  Returns void

medianRank

• medianRank(rankValue, downwardSweep): void

• Attempts to minimise the median placement of connected cells on this rank and one of the adjacent ranks

  Parameters

  • rankValue: number

    the layer number of this rank
  • downwardSweep: boolean

    whether or not this is a downward sweep through the graph

  Returns void

medianValue

• medianValue(connectedCells, rankValue): number

• 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

  Parameters

  • connectedCells: GraphAbstractHierarchyCell[]

    the cells on the specified rank connected to the specified cell
  • rankValue: number

    the rank that the connected cell lie upon

  Returns number

transpose

• transpose(mainLoopIteration, model): void

• Takes each possible adjacent cell pair on each rank and checks if swapping them around reduces the number of crossing

  Parameters

  • mainLoopIteration: number

    the iteration number of the main loop
  • model: GraphHierarchyModel

    the internal model describing the hierarchy

  Returns void

weightedMedian

• weightedMedian(iteration, model): void

• Sweeps up or down the layout attempting to minimise the median placement of connected cells on adjacent ranks

  Parameters

  • iteration: number

    the iteration number of the main loop
  • model: GraphHierarchyModel

    the internal model describing the hierarchy

  Returns void