Approach Summary
DFS/BFS to mark connected nodes, or Union-Find to merge edges. Count distinct components.
How to Recognize This Pattern
- Count connected components in undirected graph
Complexity Analysis
Time Complexity
O(V + E)
Space Complexity
O(V)
Tags
Graph DFS Union Find