Class mxMedianHybridCrossingReduction
java.lang.Object
com.mxgraph.layout.hierarchical.stage.mxMedianHybridCrossingReduction
- All Implemented Interfaces:
mxHierarchicalLayoutStage
Performs a vertex ordering within ranks as described by Gansner et al 1993
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionprotected class
A utility class used to track cells whilst sorting occurs on the median values. -
Field Summary
FieldsModifier and TypeFieldDescriptionprotected int
The total number of crossings found in the best configuration so farprotected int
protected mxHierarchicalLayout
Reference to the enclosing layout algorithmprotected int
The maximum number of iterations to perform whilst reducing edge crossingsprotected int
protected mxGraphAbstractHierarchyCell[][]
Stores each rank as a collection of cells in the best order found for each layer so far -
Constructor Summary
ConstructorsConstructorDescriptionConstructor that has the roots specified -
Method Summary
Modifier and TypeMethodDescriptionprotected int
calculateRankCrossing
(int i, mxGraphHierarchyModel model) Calculates the number of edges crossings between the specified rank and the rank below itvoid
Performs a vertex ordering within ranks as described by Gansner et al 1993
-
Field Details
-
layout
Reference to the enclosing layout algorithm -
maxIterations
protected int maxIterationsThe maximum number of iterations to perform whilst reducing edge crossings -
nestedBestRanks
Stores each rank as a collection of cells in the best order found for each layer so far -
currentBestCrossings
protected int currentBestCrossingsThe total number of crossings found in the best configuration so far -
iterationsWithoutImprovement
protected int iterationsWithoutImprovement -
maxNoImprovementIterations
protected int maxNoImprovementIterations
-
-
Constructor Details
-
mxMedianHybridCrossingReduction
Constructor that has the roots specified
-
-
Method Details
-
execute
Performs a vertex ordering within ranks as described by Gansner et al 1993- Specified by:
execute
in interfacemxHierarchicalLayoutStage
-
calculateRankCrossing
Calculates the number of edges crossings between the specified rank and the rank below it- Parameters:
i
- the topmost rank of the pair ( higher rank value )model
- the internal hierarchy model of the graph- Returns:
- the number of edges crossings with the rank beneath
-