(called Disjoint-Set data structure and Merge-Find set) is an algorithm used for partitioning, joining, connecting sets or an element(called Singleton). it is named from its two operation.
- Find - Determines which set a particular element is in and what element is the root of the set. Also useful for determining if two elements are in the same set.
- Union - Combine or merge two sets into a single set.
This algorithm is used in different applications (e.g. Games,Network Connectivity,Image Processing).
For more, just go to my source by clicking the following sites:
