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).

Union/Find Algorithm Visualization. Copyright © 2004, 2007 Cris Kania, Cliff Shaffer. This visualization is free software, distributed under the terms of version 3 of the GNU General Public License, and comes with ABSOLUTELY NO WARRANTY. You are welcome to redistribute it under certain conditions. See the GNU General Public License for more details.

This visualization is part of the algoviz@vt collection, and is hosted and maintained as part of the OpenAlgoViz SourceForge project.

Last updated: [01/26/2009]