Uses of Interface
com.jgraph.layout.JGraphFacade.CellVisitor
Packages that use JGraphFacade.CellVisitor
Package
Description
JGraphLayout's topmost package which contains the basic layout classes and interfaces.
JGraphLayout hierarchical layout internal model for representing the graph in
a manner that provide high performance for the layout
-
Uses of JGraphFacade.CellVisitor in com.jgraph.layout
Methods in com.jgraph.layout with parameters of type JGraphFacade.CellVisitorModifier and TypeMethodDescriptionvoidJGraphFacade.bfs(Object root, JGraphFacade.CellVisitor visitor) Performs a breath-first search of the input graph from the specified root cell using the specified visitor to extract the tree information.voidJGraphFacade.dfs(Object root, JGraphFacade.CellVisitor visitor) Performs a depth-first search of the input graph from the specified root cell using the specified visitor to extract the tree information.voidJGraphFacade.dfs(Object parent, Object root, Object previousSibling, JGraphFacade.CellVisitor visitor, Set seen, int layer, int sibling) Performs a depth-first search of the input graph from the specified root cell using the specified visitor to extract the tree informationvoidJGraphFacade.dfs(Object parent, Object root, Object previousSibling, JGraphFacade.CellVisitor visitor, Set seen, Set ancestors, int layer, int sibling) Performs a depth-first search of the input graph from the specified root cell using the specified visitor to extract the tree information -
Uses of JGraphFacade.CellVisitor in com.jgraph.layout.hierarchical.model
Methods in com.jgraph.layout.hierarchical.model with parameters of type JGraphFacade.CellVisitorModifier and TypeMethodDescriptionvoidJGraphHierarchyModel.dfs(JGraphHierarchyNode parent, JGraphHierarchyNode root, JGraphHierarchyEdge connectingEdge, JGraphFacade.CellVisitor visitor, Set seen, int layer) Performs a depth first search on the internal hierarchy modelvoidJGraphHierarchyModel.dfs(JGraphHierarchyNode parent, JGraphHierarchyNode root, JGraphHierarchyEdge connectingEdge, JGraphFacade.CellVisitor visitor, Set seen, int[] ancestors, int childHash, int layer) Performs a depth first search on the internal hierarchy model.voidJGraphHierarchyModel.dfs(JGraphFacade.CellVisitor visitor, Object[] dfsRoots, boolean trackAncestors, Set seenNodes) A depth first search through the internal heirarchy model