To implement, use Disjoint Set ADT
Problem: maintain information about a collection of sets S1,...,Sk that is dynamically changing through merges (unions)
Operations
- MakeSet (x): create new singleton set consisting of x
- Union (S,T): replace sets S, T by S U T
- Find(x): return “name” of set S such that x is in S.