By Barayuda Gautama3 min read
Union-Find (DSU): Fast Connectivity, Cycle Checks, and Kruskal
Union-Find (Disjoint Set Union) solves dynamic connectivity in near constant time. This guide covers path compression, union by size, cycle detection, and minimum spanning tree basics.