JGraph X 1.3.0.0

## Uses of Class
com.mxgraph.layout.hierarchical.model.mxGraphHierarchyNode

Packages that use mxGraphHierarchyNode
com.mxgraph.layout.hierarchical.model

Uses of mxGraphHierarchyNode in com.mxgraph.layout.hierarchical.model

Fields in com.mxgraph.layout.hierarchical.model declared as mxGraphHierarchyNode
`mxGraphHierarchyNode` `mxGraphHierarchyEdge.source` The node this edge is sourced at
`mxGraphHierarchyNode` `mxGraphHierarchyEdge.target` The node this edge targets

Fields in com.mxgraph.layout.hierarchical.model with type parameters of type mxGraphHierarchyNode
`protected java.util.Map<java.lang.Object,mxGraphHierarchyNode>` `mxGraphHierarchyModel.vertexMapper` Map from graph vertices to internal model nodes

Methods in com.mxgraph.layout.hierarchical.model that return types with arguments of type mxGraphHierarchyNode
`java.util.Map<java.lang.Object,mxGraphHierarchyNode>` `mxGraphHierarchyModel.getVertexMapping()`

Methods in com.mxgraph.layout.hierarchical.model with parameters of type mxGraphHierarchyNode
`protected void` `mxGraphHierarchyModel.createInternalCells(mxHierarchicalLayout layout, java.lang.Object[] vertices, mxGraphHierarchyNode[] internalVertices)` Creates all edges in the internal model
`void` `mxGraphHierarchyModel.dfs(mxGraphHierarchyNode parent, mxGraphHierarchyNode root, mxGraphHierarchyEdge connectingEdge, mxGraphHierarchyModel.CellVisitor visitor, java.util.Set<mxGraphHierarchyNode> seen, int layer)` Performs a depth first search on the internal hierarchy model
`void` `mxGraphHierarchyModel.dfs(mxGraphHierarchyNode parent, mxGraphHierarchyNode root, mxGraphHierarchyEdge connectingEdge, mxGraphHierarchyModel.CellVisitor visitor, java.util.Set<mxGraphHierarchyNode> seen, int[] ancestors, int childHash, int layer)` Performs a depth first search on the internal hierarchy model.
`boolean` `mxGraphHierarchyNode.isAncestor(mxGraphHierarchyNode otherNode)`
`void` `mxGraphHierarchyModel.visit(mxGraphHierarchyModel.CellVisitor visitor, mxGraphHierarchyNode[] dfsRoots, boolean trackAncestors, java.util.Set<mxGraphHierarchyNode> seenNodes)` A depth first search through the internal hierarchy model
`void` `mxGraphHierarchyModel.CellVisitor.visit(mxGraphHierarchyNode parent, mxGraphHierarchyNode cell, mxGraphHierarchyEdge connectingEdge, int layer, int seen)` The method within which the visitor will perform operations upon the graph model

Method parameters in com.mxgraph.layout.hierarchical.model with type arguments of type mxGraphHierarchyNode
`void` `mxGraphHierarchyModel.dfs(mxGraphHierarchyNode parent, mxGraphHierarchyNode root, mxGraphHierarchyEdge connectingEdge, mxGraphHierarchyModel.CellVisitor visitor, java.util.Set<mxGraphHierarchyNode> seen, int layer)` Performs a depth first search on the internal hierarchy model
`void` `mxGraphHierarchyModel.dfs(mxGraphHierarchyNode parent, mxGraphHierarchyNode root, mxGraphHierarchyEdge connectingEdge, mxGraphHierarchyModel.CellVisitor visitor, java.util.Set<mxGraphHierarchyNode> seen, int[] ancestors, int childHash, int layer)` Performs a depth first search on the internal hierarchy model.
`void` `mxGraphHierarchyModel.setVertexMapping(java.util.Map<java.lang.Object,mxGraphHierarchyNode> vertexMapping)`
`void` `mxGraphHierarchyModel.visit(mxGraphHierarchyModel.CellVisitor visitor, mxGraphHierarchyNode[] dfsRoots, boolean trackAncestors, java.util.Set<mxGraphHierarchyNode> seenNodes)` A depth first search through the internal hierarchy model

JGraph X 1.3.0.0

Copyright (c) 2008 Gaudenz Alder. All rights reserved.