JGraph X 1.3.0.0

## Uses of Class
com.mxgraph.analysis.mxUnionFind.Node

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 java.util.Map<java.lang.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(java.lang.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.

JGraph X 1.3.0.0

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