Package | Description |
---|---|
com.mxgraph.layout.hierarchical.model |
Modifier and Type | Field | Description |
---|---|---|
mxGraphHierarchyNode |
mxGraphHierarchyEdge.source |
The node this edge is sourced at
|
mxGraphHierarchyNode |
mxGraphHierarchyEdge.target |
The node this edge targets
|
Modifier and Type | Field | Description |
---|---|---|
protected java.util.Map<java.lang.Object,mxGraphHierarchyNode> |
mxGraphHierarchyModel.vertexMapper |
Map from graph vertices to internal model nodes
|
Modifier and Type | Method | Description |
---|---|---|
java.util.Map<java.lang.Object,mxGraphHierarchyNode> |
mxGraphHierarchyModel.getVertexMapper() |
Modifier and Type | Method | Description |
---|---|---|
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.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
|
void |
mxGraphHierarchyModel.visit(mxGraphHierarchyModel.CellVisitor visitor,
mxGraphHierarchyNode[] dfsRoots,
boolean trackAncestors,
java.util.Set<mxGraphHierarchyNode> seenNodes) |
A depth first search through the internal hierarchy model
|
Modifier and Type | Method | Description |
---|---|---|
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.setVertexMapper(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
|
Copyright (c) 2010-2017 Gaudenz Alder, JGraph Ltd. All rights reserved.