Revision as of 23:53, 3 October 2004 edit Dcoetzee (talk \| contribs) 37,529 edits →Finding the [[connected component]]s of an [[undirected graph]]: Er, finish this section ← Previous edit		Revision as of 23:55, 3 October 2004 edit undo Dcoetzee (talk \| contribs) 37,529 edits NOTOC, for now 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 ==

Disjoint-set data structure: Difference between revisions