Connected Components Using BFS in DSA Python - Time & Space Complexity

Time Complexity: Connected Components Using BFS

O(n + m)

Understanding Time Complexity

We want to understand how long it takes to find all connected parts in a graph using BFS.

How does the time needed grow when the graph gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

def connected_components(graph):
    visited = set()
    count = 0
    for node in graph:
        if node not in visited:
            queue = [node]
            visited.add(node)
            while queue:
                current = queue.pop(0)
                for neighbor in graph[current]:
                    if neighbor not in visited:
                        visited.add(neighbor)
                        queue.append(neighbor)
            count += 1
    return count

This code counts how many connected groups are in an undirected graph using BFS.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Visiting each node and its neighbors once using BFS.
• How many times: Each node and edge is checked once during the BFS traversals.

How Execution Grows With Input

As the graph grows, the time grows with the number of nodes and edges.

Input Size (n nodes, m edges)	Approx. Operations
10 nodes, 15 edges	About 25 checks (nodes + edges)
100 nodes, 200 edges	About 300 checks
1000 nodes, 5000 edges	About 6000 checks

Pattern observation: The work grows roughly with the sum of nodes and edges.

Final Time Complexity

Time Complexity: O(n + m)

This means the time grows linearly with the number of nodes plus edges in the graph.

Common Mistake

[X] Wrong: "The BFS runs in O(n²) because of the nested loops."

[OK] Correct: Each edge and node is visited only once, so the total work is proportional to nodes plus edges, not their product.

Interview Connect

Understanding BFS time complexity helps you explain graph traversal efficiency clearly, a key skill in many coding interviews.

Self-Check

"What if the graph was represented as an adjacency matrix instead of adjacency lists? How would the time complexity change?"

Practice

1. What does the BFS algorithm help find in an undirected graph when used for connected components?

easy

A. All nodes reachable from a starting node forming one connected component

B. The shortest path between two nodes only

C. The maximum degree of any node in the graph

D. The total number of edges in the graph

Solution

1. Step 1: Understand BFS in graph context

   BFS explores all nodes reachable from a given start node by visiting neighbors level by level.

2. Step 2: Connect BFS to connected components

   Using BFS from an unvisited node finds all nodes in that node's connected component.

3. Final Answer:

   All nodes reachable from a starting node forming one connected component -> Option A

4. Quick Check:

   BFS finds connected components by exploring reachable nodes [OK]

Hint: BFS explores all nodes connected to start node [OK]

Common Mistakes:

• Confusing BFS with shortest path only
• Thinking BFS counts edges
• Mixing BFS with node degree calculation

2. Which of the following is the correct way to initialize a queue for BFS in Python?

easy

A. queue = []

B. queue = dict()

C. queue = set()

D. queue = collections.deque()

Solution

1. Step 1: Identify BFS queue requirements

   BFS requires a queue data structure to process nodes in FIFO order.

2. Step 2: Choose correct Python queue type

   collections.deque() is efficient for queue operations (append and popleft).

3. Final Answer:

   queue = collections.deque() -> Option D

4. Quick Check:

   Use deque for BFS queue in Python [OK]

Hint: Use deque for efficient FIFO queue in BFS [OK]

Common Mistakes:

• Using list which is inefficient for popping front
• Using set which is unordered
• Using dict which is key-value store

3. What is the output of the following code snippet that finds connected components using BFS?

graph = {0: [1], 1: [0, 2], 2: [1], 3: []}
visited = set()
components = []

for node in graph:
    if node not in visited:
        queue = collections.deque([node])
        comp = []
        while queue:
            current = queue.popleft()
            if current not in visited:
                visited.add(current)
                comp.append(current)
                queue.extend(n for n in graph[current] if n not in visited)
        components.append(sorted(comp))
print(components)

medium

A. [[0], [1], [2], [3]]

B. [[0, 1], [2, 3]]

C. [[0, 1, 2], [3]]

D. [[3], [0, 1, 2]]

Solution

1. Step 1: Analyze graph structure

   Nodes 0,1,2 are connected; node 3 is isolated.

2. Step 2: Trace BFS for each component

   Starting at 0, BFS visits 0,1,2; then 3 alone forms second component.

3. Final Answer:

   [[0, 1, 2], [3]] -> Option C

4. Quick Check:

   Connected components = [[0,1,2],[3]] [OK]

Hint: Group nodes reachable from each unvisited node [OK]

Common Mistakes:

• Not sorting component lists
• Mixing isolated node with others
• Forgetting to mark visited nodes

4. Identify the bug in this BFS connected components code snippet:

def bfs_components(graph):
    visited = set()
    components = []
    for node in graph:
        if node not in visited:
            queue = [node]
            comp = []
            while queue:
                current = queue.pop()
                if current not in visited:
                    visited.add(current)
                    comp.append(current)
                    for neighbor in graph[current]:
                        if neighbor not in visited:
                            queue.append(neighbor)
            components.append(comp)
    return components

medium

A. Using list pop() removes from end, not front, breaking BFS order

B. Visited set is not updated correctly

C. Neighbors are not checked for visited status

D. Components list is not returned

Solution

1. Step 1: Check queue operations

   Using list pop() removes last element, making it DFS, not BFS.

2. Step 2: Understand BFS queue behavior

   BFS requires FIFO, so pop(0) or deque.popleft() is needed.

3. Final Answer:

   Using list pop() removes from end, not front, breaking BFS order -> Option A

4. Quick Check:

   pop() removes last, use popleft() for BFS [OK]

Hint: Use popleft() or pop(0) for BFS queue [OK]

Common Mistakes:

• Using pop() instead of popleft()
• Not marking visited before enqueue
• Appending neighbors without check

5. Given a graph represented as adjacency list:

graph = {0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5], 5: [4], 6: []}

Write a BFS-based approach to find the number of connected components and return the size of the largest component.

hard

A. Number of components = 4, Largest size = 2

B. Number of components = 3, Largest size = 4

C. Number of components = 2, Largest size = 4

D. Number of components = 3, Largest size = 2

Solution

1. Step 1: Identify connected components

   Components are: {0,1,2,3}, {4,5}, {6} totaling 3 components.

2. Step 2: Calculate sizes

   Sizes are 4, 2, and 1 respectively; largest is 4 nodes.

3. Step 3: Re-check sizes carefully

   Node 6 is isolated (size 1), so largest component size is 4.

4. Final Answer:

   Number of components = 3, Largest size = 4 -> Option B

5. Quick Check:

   3 components, largest has 4 nodes [OK]

Hint: Count components and track max size during BFS [OK]

Common Mistakes:

• Counting isolated nodes incorrectly
• Mixing component sizes
• Forgetting to update largest size