com.jgraph.layout.hierarchical
public class JGraphMedianHybridCrossingReduction extends Object implements JGraphHierarchicalLayoutStep, JGraphLayout.Stoppable
| Nested Class Summary | |
|---|---|
| protected class | JGraphMedianHybridCrossingReduction.MedianCellSorter
A utility class used to track cells whilst sorting occurs on the median
values. |
| Field Summary | |
|---|---|
| protected int | currentBestCrossings
The total number of crossings found in the best configuration so far |
| protected int | iterationsWithoutImprovement |
| protected int | maxIterations
The maximum number of iterations to perform whilst reducing edge
crossings |
| protected int | maxNoImprovementIterations |
| protected Object[][] | nestedBestRanks
Stores each rank as a collection of cells in the best order found for
each layer so far |
| protected JGraphLayoutProgress | progress
The layout progress bar |
| Method Summary | |
|---|---|
| protected int | calculateRankCrossing(int i, JGraphHierarchyModel model)
Calculates the number of edges crossings between the specified rank and
the rank below it
|
| JGraphLayoutProgress | getProgress() |
| JGraphHierarchyModel | run(JGraphFacade facade, JGraphHierarchyModel model)
Performs a vertex ordering within ranks as described by Gansner et al
1993
|
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
Returns: Returns the progress.
Parameters: facade the facade describing the input graph model an internal model of the hierarchical layout
Returns: the updated hierarchy model