Revision as of 00:23, 4 October 2004 edit Dcoetzee (talk \| contribs) 37,529 edits A bit more explanation and another link ← Previous edit		Revision as of 00:40, 4 October 2004 edit undo Dcoetzee (talk \| contribs) 37,529 edits More links, more links! Next edit →
Line 5: While we could represent the sets themselves as objects and have the operations operate on these sets, the more common approach is to choose an element from each set as a ''representative''; then, '''Find''' returns the representative of the set that the given element is in, and '''Union''' takes the representatives of two given sets. ~~__NOTOC__~~ == Disjoint-set linked lists == Line 52: * [http://research.compaq.com/SRC/zeus/unionfind.html Compaq Research: Zeus: Animation of Union-Find Algorithms] * [http://www.cs.unm.edu/~rlpm/499/uf.html Java applet: A Graphical Union-Find Implementation], by Rory L. P. McGuire * [http://www.cs.rutgers.edu/~chvatal/notes/uf.html A simple C implementation] by Vašek Chvátal * ''[http://citeseer.ist.psu.edu/anderson94waitfree.html Wait-free Parallel Algorithms for the Union-Find Problem]'', a [[1994]] paper by Richard J. Anderson and Heather Woll describing a parallelized version of Union-Find that never needs to block * [http://gont.pld.org.pl/ Gont]], a little-known programming language with Union-Find in its standard library

Disjoint-set data structure: Difference between revisions