|
mxGraph 2.5.0.2 |
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use mxUnionFind.Node | |
---|---|
com.mxgraph.analysis | This package provides various algorithms for graph analysis, such as shortest path and minimum spanning tree. |
Uses of mxUnionFind.Node in com.mxgraph.analysis |
---|
Fields in com.mxgraph.analysis declared as mxUnionFind.Node | |
---|---|
protected mxUnionFind.Node |
mxUnionFind.Node.parent
Reference to the parent node. |
Fields in com.mxgraph.analysis with type parameters of type mxUnionFind.Node | |
---|---|
protected Map<Object,mxUnionFind.Node> |
mxUnionFind.nodes
Maps from elements to nodes |
Methods in com.mxgraph.analysis that return mxUnionFind.Node | |
---|---|
mxUnionFind.Node |
mxUnionFind.find(mxUnionFind.Node node)
Returns the set that contains node . |
mxUnionFind.Node |
mxUnionFind.getNode(Object element)
Returns the node that represents element. |
mxUnionFind.Node |
mxUnionFind.Node.getParent()
|
Methods in com.mxgraph.analysis with parameters of type mxUnionFind.Node | |
---|---|
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. |
|
mxGraph 2.5.0.2 |
|||||||||
PREV NEXT | FRAMES NO FRAMES |