Connected Components

Watch the graph split into its connected components — run BFS from each unvisited node, and colour every group of mutually reachable nodes.

Time: O(V + E)

Space: O(V)

Uses: BFS / DFS

Graph: Undirected

Components found:0

Speed: 1000ms

Step 1 of 0100%

Unvisited

Exploring

Component (one colour each)

Components:

None yet

Time:O(V + E)

Space:O(V)

Traversal:BFS or DFS

Graph type:Undirected

Question 1 of 3

What is a connected component in an undirected graph?

DSAverse

Graph Algorithms

Loading Graph Algorithms...

BFS Traversal

visited: 0 / 7