Content deleted Content added
-wikicode |
No edit summary |
||
Line 1:
Keigo Kawaji
Given a set of elements, it is often useful to break them up or partition them into a number of separate, nonoverlapping groups. A '''disjoint-set data structure''' is a [[data structure]] that keeps track of such a partitioning. A '''union-find algorithm''' is an algorithm that performs two useful operations on such a data structure:
* '''Find''': Determine which group a particular element is in. Also useful for determining if two elements are in the same group.
| |||