Problem Statement
Count number of connected components in graph.
Approach
DFS/BFS from each unvisited node. Each traversal = 1 component.
Time & Space Complexity
Time O(V+E), Space O(V).

The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview
Count components using DFS/BFS.
Count number of connected components in graph.
DFS/BFS from each unvisited node. Each traversal = 1 component.
Time O(V+E), Space O(V).
Loading Interactive Visualizer...
Click "Play" or use arrow keys to step through the execution.