Package | Description |
---|---|
com.jgraph.layout.hierarchical |
JGraphLayout hierarchical package which contains directed hierarchy layout algorithms.
|
Modifier and Type | Field and Description |
---|---|
protected JGraphHierarchyModel |
JGraphHierarchicalLayout.model
The internal model formed of the layout
|
Modifier and Type | Method and Description |
---|---|
JGraphHierarchyModel |
JGraphMedianHybridCrossingReduction.run(JGraphFacade facade,
JGraphHierarchyModel model)
Performs a vertex ordering within ranks as described by Gansner et al
1993
|
JGraphHierarchyModel |
JGraphLongestPathLayering.run(JGraphFacade facade,
JGraphHierarchyModel model)
Produces the layer assignmment using the graph information specified
|
JGraphHierarchyModel |
JGraphMinimumCycleRemover.run(JGraphFacade facade,
JGraphHierarchyModel model)
Produces the layer assignmment using the graph information specified
|
JGraphHierarchyModel |
JGraphHierarchicalLayoutStep.run(JGraphFacade graph,
JGraphHierarchyModel model)
Takes the graph detail and configuration information within the facade
and creates the resulting laid out graph within that facade for further
use
|
JGraphHierarchyModel |
JGraphCoordinateAssignment.run(JGraphFacade facade,
JGraphHierarchyModel model)
A basic horizontal coordinate assignment algorithm
|
JGraphHierarchyModel |
JGraphNetworkSimplexLayering.run(JGraphFacade facade,
JGraphHierarchyModel model)
Assigns rank using a network simplex formulation
|
JGraphHierarchyModel |
JGraphGreedyCycleRemover.run(JGraphFacade facade,
JGraphHierarchyModel model)
Reverses cycles in the internal model using the graph information
specified
|
Modifier and Type | Method and Description |
---|---|
protected int |
JGraphMedianHybridCrossingReduction.calculateRankCrossing(int i,
JGraphHierarchyModel model)
Calculates the number of edges crossings between the specified rank and
the rank below it
|
protected void |
JGraphCoordinateAssignment.calculateWidestRank(JGraphFacade facade,
JGraphHierarchyModel model)
Calculates the width rank in the hierarchy.
|
protected void |
JGraphCoordinateAssignment.rankCoordinates(int rankValue,
JGraphFacade facade,
JGraphHierarchyModel model)
Sets up the layout in an initial positioning.
|
protected void |
JGraphCoordinateAssignment.rankMedianPosition(int rankValue,
JGraphHierarchyModel model,
int nextRankValue)
Performs median minimisation over one rank.
|
JGraphHierarchyModel |
JGraphMedianHybridCrossingReduction.run(JGraphFacade facade,
JGraphHierarchyModel model)
Performs a vertex ordering within ranks as described by Gansner et al
1993
|
JGraphHierarchyModel |
JGraphLongestPathLayering.run(JGraphFacade facade,
JGraphHierarchyModel model)
Produces the layer assignmment using the graph information specified
|
JGraphHierarchyModel |
JGraphMinimumCycleRemover.run(JGraphFacade facade,
JGraphHierarchyModel model)
Produces the layer assignmment using the graph information specified
|
JGraphHierarchyModel |
JGraphHierarchicalLayoutStep.run(JGraphFacade graph,
JGraphHierarchyModel model)
Takes the graph detail and configuration information within the facade
and creates the resulting laid out graph within that facade for further
use
|
JGraphHierarchyModel |
JGraphCoordinateAssignment.run(JGraphFacade facade,
JGraphHierarchyModel model)
A basic horizontal coordinate assignment algorithm
|
JGraphHierarchyModel |
JGraphNetworkSimplexLayering.run(JGraphFacade facade,
JGraphHierarchyModel model)
Assigns rank using a network simplex formulation
|
JGraphHierarchyModel |
JGraphGreedyCycleRemover.run(JGraphFacade facade,
JGraphHierarchyModel model)
Reverses cycles in the internal model using the graph information
specified
|
Copyright (C) 2001-2009 JGraph Ltd. All rights reserved.