Connected Components

← Back to Disjoint Set Union-Find

A connected component is a maximal set of vertices where every pair is reachable from each other. Union-Find efficiently tracks components as edges are added. Used in Kruskal’s MST algorithm and dynamic connectivity.

property graphs union-find