|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
PartitionElement<T> | A partition is a division of a group of objects into disjoint sets that we call components. |
Class Summary | |
---|---|
UnionFindNode<T> | The UnionFindNode class provides an implementation of the PartitionElement ADT using the union-find data structure. |
A partition is a division of a group of objects into disjoint sets that we call components. Each component in the partition is defined by an (arbitrary) element of that component known as the representative element, or simply the representative. The Partition ADT is represented as a set of partition elements.
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |