Graph/union_find library

🔗 Union-Find (Disjoint Set Union, DSU)

Re-exports the shared DisjointSet as a convenient UnionFind typedef for graph algorithms like Kruskal's MST and Connected Components.

Typedefs

UnionFind<T> = DisjointSet<T>