| Package | Description |
|---|---|
| com.mxgraph.analysis |
This package provides various algorithms for graph analysis, such as
shortest path and minimum spanning tree.
|
| Modifier and Type | Field | Description |
|---|---|---|
protected mxUnionFind.Node |
mxUnionFind.Node.parent |
Reference to the parent node.
|
| Modifier and Type | Field | Description |
|---|---|---|
protected java.util.Map<java.lang.Object,mxUnionFind.Node> |
mxUnionFind.nodes |
Maps from elements to nodes
|
| Modifier and Type | Method | Description |
|---|---|---|
mxUnionFind.Node |
mxUnionFind.find(mxUnionFind.Node node) |
Returns the set that contains
node. |
mxUnionFind.Node |
mxUnionFind.getNode(java.lang.Object element) |
Returns the node that represents element.
|
mxUnionFind.Node |
mxUnionFind.Node.getParent() |
| Modifier and Type | Method | Description |
|---|---|---|
mxUnionFind.Node |
mxUnionFind.find(mxUnionFind.Node node) |
Returns the set that contains
node. |
void |
mxUnionFind.Node.setParent(mxUnionFind.Node parent) |
|
void |
mxUnionFind.union(mxUnionFind.Node a,
mxUnionFind.Node b) |
Unifies the sets
a and b in constant time
using a union by rank on the tree size. |
Copyright (c) 2010-2017 Gaudenz Alder, JGraph Ltd. All rights reserved.