DisjointSet<'a> Type
Disjoint Set Union (Union-Find) data structure.
Efficiently tracks a partition of elements into disjoint sets. Uses path compression and union by rank for near-constant time operations.
Time Complexity: O(α(n)) amortized per operation, where α is the inverse Ackermann function (effectively constant for all practical purposes, less than 5 for 2^65536 elements).