Connectivity (Union-Find)

Build a Disjoint Set Union step by step — find, union, union by size, path compression, and component counting — then apply it to count friend circles the way network connectivity and Kruskal’s MST do.