This is the core algorithm used to implement Disjoint Set Union (DSU) data structure. It consists of two operations, union and find. It enables efficient implementation of operations like connected components, cycle detection and minimum spanning trees.