Uses of Class
com.jgraph.layout.hierarchical.model.JGraphHierarchyModel
Packages that use JGraphHierarchyModel
Package
Description
JGraphLayout hierarchical package which contains directed hierarchy layout algorithms.
-
Uses of JGraphHierarchyModel in com.jgraph.layout.hierarchical
Fields in com.jgraph.layout.hierarchical declared as JGraphHierarchyModelModifier and TypeFieldDescriptionprotected JGraphHierarchyModelJGraphHierarchicalLayout.modelThe internal model formed of the layoutMethods in com.jgraph.layout.hierarchical that return JGraphHierarchyModelModifier and TypeMethodDescriptionJGraphCoordinateAssignment.run(JGraphFacade facade, JGraphHierarchyModel model) A basic horizontal coordinate assignment algorithmJGraphGreedyCycleRemover.run(JGraphFacade facade, JGraphHierarchyModel model) Reverses cycles in the internal model using the graph information specifiedJGraphHierarchicalLayoutStep.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 useJGraphLongestPathLayering.run(JGraphFacade facade, JGraphHierarchyModel model) Produces the layer assignmment using the graph information specifiedJGraphMedianHybridCrossingReduction.run(JGraphFacade facade, JGraphHierarchyModel model) Performs a vertex ordering within ranks as described by Gansner et al 1993JGraphMinimumCycleRemover.run(JGraphFacade facade, JGraphHierarchyModel model) Produces the layer assignmment using the graph information specifiedJGraphNetworkSimplexLayering.run(JGraphFacade facade, JGraphHierarchyModel model) Assigns rank using a network simplex formulationMethods in com.jgraph.layout.hierarchical with parameters of type JGraphHierarchyModelModifier and TypeMethodDescriptionprotected intJGraphMedianHybridCrossingReduction.calculateRankCrossing(int i, JGraphHierarchyModel model) Calculates the number of edges crossings between the specified rank and the rank below itprotected voidJGraphCoordinateAssignment.calculateWidestRank(JGraphFacade facade, JGraphHierarchyModel model) Calculates the width rank in the hierarchy.protected voidJGraphCoordinateAssignment.rankCoordinates(int rankValue, JGraphFacade facade, JGraphHierarchyModel model) Sets up the layout in an initial positioning.protected voidJGraphCoordinateAssignment.rankMedianPosition(int rankValue, JGraphHierarchyModel model, int nextRankValue) Performs median minimisation over one rank.JGraphCoordinateAssignment.run(JGraphFacade facade, JGraphHierarchyModel model) A basic horizontal coordinate assignment algorithmJGraphGreedyCycleRemover.run(JGraphFacade facade, JGraphHierarchyModel model) Reverses cycles in the internal model using the graph information specifiedJGraphHierarchicalLayoutStep.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 useJGraphLongestPathLayering.run(JGraphFacade facade, JGraphHierarchyModel model) Produces the layer assignmment using the graph information specifiedJGraphMedianHybridCrossingReduction.run(JGraphFacade facade, JGraphHierarchyModel model) Performs a vertex ordering within ranks as described by Gansner et al 1993JGraphMinimumCycleRemover.run(JGraphFacade facade, JGraphHierarchyModel model) Produces the layer assignmment using the graph information specifiedJGraphNetworkSimplexLayering.run(JGraphFacade facade, JGraphHierarchyModel model) Assigns rank using a network simplex formulation