Revision as of 22:21, 3 October 2004 edit Dcoetzee (talk \| contribs) 37,529 edits Wrote intro		Revision as of 22:21, 3 October 2004 edit undo Dcoetzee (talk \| contribs) 37,529 edits Wrote intro Next edit →
Line 1: In [[computer science]], a '''disjoint-set data structure''' is a [[data structure]] that assigns each element in a set to one of a number of disjoint (nonoverlapping) groups of elements. A '''union-find algorithm''' is a way of performing two critical operations on such a data structure: * '''Find''': Determine which group a particular element is in. * '''Union''': Combine two groups into a single group.

Disjoint-set data structure: Difference between revisions