Connected Components Using BFS in DSA C - Execution Trace

Concept Flow - Connected Components Using BFS

Start with all nodes unvisited

↓

Pick an unvisited node

↓

Initialize queue with this node

↓

While queue not empty

↓

Dequeue node, mark visited

↓

Enqueue all unvisited neighbors

↓

Repeat until queue empty

↓

One connected component found

↓

Repeat for next unvisited node

↓

All nodes visited, done

The BFS explores all nodes connected to a starting node, marking them visited to find one connected component. Repeat for all unvisited nodes to find all components.

Execution Sample

DSA C

void bfs(int start) {
  queue<int> q;
  q.push(start);
  visited[start] = true;
  while (!q.empty()) {
    int node = q.front(); q.pop();
    for (auto nbr : graph[node]) {
      if (!visited[nbr]) {
        visited[nbr] = true;
        q.push(nbr);
      }
    }
  }
}

This BFS function visits all nodes connected to 'start', marking them visited and using a queue to explore neighbors.

Execution Table

Step	Operation	Current Node	Queue State	Visited Nodes	Connected Component Found
1	Start BFS from node 0	-	[0]	[0]	[0]
2	Dequeue node 0	0	[]	[0]	[0]
3	Enqueue neighbors of 0: 1, 2	-	[1, 2]	[0,1,2]	[0,1,2]
4	Dequeue node 1	1	[2]	[0,1,2]	[0,1,2]
5	Enqueue neighbors of 1: 0 (visited), 3	-	[2, 3]	[0,1,2,3]	[0,1,2,3]
6	Dequeue node 2	2	[3]	[0,1,2,3]	[0,1,2,3]
7	Enqueue neighbors of 2: 0 (visited)	-	[3]	[0,1,2,3]	[0,1,2,3]
8	Dequeue node 3	3	[]	[0,1,2,3]	[0,1,2,3]
9	Enqueue neighbors of 3: 1 (visited)	-	[]	[0,1,2,3]	[0,1,2,3]
10	Queue empty, component complete	-	[]	[0,1,2,3]	[0,1,2,3]
11	Start BFS from next unvisited node 4	-	[4]	[0,1,2,3,4]	[0,1,2,3],[4]
12	Dequeue node 4	4	[]	[0,1,2,3,4]	[0,1,2,3],[4]
13	Enqueue neighbors of 4: 5	-	[5]	[0,1,2,3,4,5]	[0,1,2,3],[4,5]
14	Dequeue node 5	5	[]	[0,1,2,3,4,5]	[0,1,2,3],[4,5]
15	Enqueue neighbors of 5: 4 (visited)	-	[]	[0,1,2,3,4,5]	[0,1,2,3],[4,5]
16	Queue empty, component complete	-	[]	[0,1,2,3,4,5]	[0,1,2,3],[4,5]
17	All nodes visited, BFS ends	-	[]	[0,1,2,3,4,5]	[0,1,2,3],[4,5]

💡 All nodes visited, no unvisited nodes remain to start BFS

Variable Tracker

Variable	Start	After Step 3	After Step 5	After Step 10	After Step 13	After Step 16	Final
visited	[false,false,false,false,false,false]	[true,true,true,false,false,false]	[true,true,true,true,false,false]	[true,true,true,true,false,false]	[true,true,true,true,true,true]	[true,true,true,true,true,true]	[true,true,true,true,true,true]
queue	[]	[1,2]	[2,3]	[]	[5]	[]	[]
connected_components	[]	[[0,1,2]]	[[0,1,2,3]]	[[0,1,2,3]]	[[0,1,2,3],[4,5]]	[[0,1,2,3],[4,5]]	[[0,1,2,3],[4,5]]

Key Moments - 3 Insights

Why do we mark nodes as visited when we enqueue them, not when we dequeue?

Marking nodes visited when enqueued (see steps 3 and 5) prevents adding the same node multiple times to the queue, avoiding repeated processing and infinite loops.

What happens if the graph is disconnected?

The BFS runs on one connected component at a time (steps 1-10 for first component, steps 11-16 for second), then starts BFS again from the next unvisited node to find all components.

Why do we stop BFS when the queue is empty?

An empty queue (steps 10 and 16) means all reachable nodes from the start node are visited, so one connected component is fully explored.

Visual Quiz - 3 Questions

Look at the execution table, what nodes are in the queue after step 5?

A [2, 3]

B [1, 2]

C [3]

D []

💡 Hint

Check the 'Queue State' column at step 5 in the execution_table.

At which step does BFS start exploring the second connected component?

A Step 10

B Step 11

C Step 13

D Step 16

💡 Hint

Look for the step where BFS starts from a new unvisited node in the execution_table.

If node 3 had an additional neighbor 6 (unvisited), when would it be added to the queue?

A At step 9 when dequeuing node 3

B At step 5 when dequeuing node 1

C At step 3 when dequeuing node 0

D At step 16 when exploring second component

💡 Hint

Neighbors are enqueued when their connected node is dequeued, see steps 3, 5, 8, 9.

Concept Snapshot

Connected Components Using BFS:
- Start BFS from any unvisited node.
- Use a queue to explore neighbors level by level.
- Mark nodes visited when enqueued to avoid repeats.
- When queue empties, one connected component is found.
- Repeat for all unvisited nodes to find all components.

Full Transcript

Connected Components Using BFS finds groups of nodes connected together in a graph. We start BFS from an unvisited node, add it to a queue, and mark it visited. Then we repeatedly dequeue nodes, visit their neighbors, and enqueue unvisited neighbors, marking them visited immediately. This process continues until the queue is empty, meaning one connected component is fully explored. Then BFS starts again from another unvisited node to find the next component. This repeats until all nodes are visited. The execution table shows each step, queue contents, visited nodes, and connected components found. Key points include marking visited when enqueued to avoid duplicates, handling disconnected graphs by restarting BFS, and stopping BFS when the queue is empty. The visual quiz tests understanding of queue states, BFS start steps, and neighbor enqueue timing.