Union/Find Algorithm Visualization
This applet was designed and implemented by Cris Kania and Cliff
Shaffer during Fall 2004.
It illustrates the use of the parent-pointer general tree
implementation for representing a collection of objects stored in
disjoint sets, also known as Union/Find after the two main operations.
This representation provides near-linear time performance for
determining if two objects from the collection are in the same
disjoint set, and for merging disjoint sets (for example, if they
represent merged equivalence classes).
Download source
Last updated: [07/26/2006]