01
Union-Find, Path Compression, and the Almost-Constant-Time Data Structure
Union-find evolved from early equivalence-class algorithms into one of the most efficient general-purpose data structures, with tree weighting and path compression giving sequences of set operations an inverse-Ackermann time bound.
↗