CentralNotice Disjoint-set data structure From Wikipedia, the free encyclopedia Jump to: navigation , search MakeSet creates 8 singletons. After some operations of Union , some sets are grouped together. In computing , a disjoint-set data structure , also called a union–find data structure or merge–find set , is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. It supports two useful operations: Find : Determine which subset a particular element is in. Find typically returns an item from this set that serves as its "representative"; by comparing the result of two Find operations, one can determine whether two elements are in the same subset. Union : Join two subsets into a single subset. The other important operation, MakeSet , which makes a set containing only a given element (a singleto...