DFS traversal and applications in Data Structures Theory - Mini Project: Build & Apply

DFS Traversal and Applications

📖 Scenario: You are exploring how to visit all connected points in a network, like checking all friends in a social circle or all connected cities on a map.

🎯 Goal: Build a simple step-by-step understanding of Depth-First Search (DFS) traversal on a graph and see how it helps find connected components.

📋 What You'll Learn

Create a graph using an adjacency list

Set up a visited tracker for nodes

Implement DFS traversal using recursion

Use DFS to count connected components in the graph

💡 Why This Matters

🌍 Real World

DFS helps explore networks like social media connections, maps, or computer networks to find all reachable points from a start.

💼 Career

Understanding DFS is fundamental for software engineers, data scientists, and network analysts to solve problems involving connectivity and traversal.

1

Create the graph as an adjacency list

Create a dictionary called graph representing this undirected graph with these edges: 1-2, 1-3, 2-4, 5-6. Use lists for neighbors.

Data Structures Theory

# Your code here

Hint

Think of the graph as a dictionary where keys are nodes and values are lists of connected nodes.

2

Set up a visited dictionary to track nodes

Create a dictionary called visited with keys as graph nodes and values set to False to mark them unvisited.

Data Structures Theory

graph = {
    1: [2, 3],
    2: [1, 4],
    3: [1],
    4: [2],
    5: [6],
    6: [5]
}
# Your code here

Hint

Use a dictionary comprehension to set all nodes as not visited.

3

Write the DFS function using recursion

Define a function called dfs that takes a node. Mark visited[node] as True. Then for each neighbor in graph[node], if it is not visited, call dfs on that neighbor.

Data Structures Theory

graph = {
    1: [2, 3],
    2: [1, 4],
    3: [1],
    4: [2],
    5: [6],
    6: [5]
}
visited = {node: False for node in graph}
# Your code here

Hint

Use recursion to visit neighbors that are not yet visited.

4

Count connected components using DFS

Create a variable count set to 0. Loop over each node in graph. If visited[node] is False, call dfs(node) and then increase count by 1.

Data Structures Theory

graph = {
    1: [2, 3],
    2: [1, 4],
    3: [1],
    4: [2],
    5: [6],
    6: [5]
}
visited = {node: False for node in graph}

def dfs(node):
    visited[node] = True
    for neighbor in graph[node]:
        if not visited[neighbor]:
            dfs(neighbor)

# Your code here

Hint

Each time you find an unvisited node, you start a new connected component.

Practice

1. What is the main idea behind Depth-First Search (DFS) traversal in a graph?

easy

A. Visit all neighbors of a node before moving deeper

B. Explore as far as possible along each branch before backtracking

C. Visit nodes in order of their distance from the start node

D. Randomly visit nodes without any specific order

Solution

1. Step 1: Understand DFS traversal approach

   DFS explores nodes by going deep into one branch before checking others.

2. Step 2: Compare with other traversal methods

   BFS visits neighbors first, but DFS goes deep first, then backtracks.

3. Final Answer:

   Explore as far as possible along each branch before backtracking -> Option B

4. Quick Check:

   DFS = deep exploration first [OK]

Hint: DFS means go deep first, then backtrack [OK]

Common Mistakes:

• Confusing DFS with BFS
• Thinking DFS visits all neighbors first
• Assuming DFS visits nodes by distance

2. Which of the following is the correct way to mark a node as visited in DFS pseudocode?

easy

A. visited[node] = True

B. visited[node] = False

C. visited = node

D. visited.append(node)

Solution

1. Step 1: Understand visited marking in DFS

   Nodes are marked visited by setting their status to True to avoid revisiting.

2. Step 2: Analyze options

   Setting visited[node] = True correctly marks the node; others are incorrect or incomplete.

3. Final Answer:

   visited[node] = True -> Option A

4. Quick Check:

   Mark visited nodes as True [OK]

Hint: Visited nodes are marked True to avoid loops [OK]

Common Mistakes:

• Marking visited as False instead of True
• Using append instead of assignment
• Assigning visited to node directly

3. Consider the following graph edges: 1->2, 1->3, 2->4, 3->4. Starting DFS from node 1, which is the order of nodes visited?

medium

A. [1, 4, 2, 3]

B. [1, 3, 4, 2]

C. [1, 2, 3, 4]

D. [1, 2, 4, 3]

Solution

1. Step 1: Start DFS at node 1 and explore neighbors

   From 1, DFS visits 2 first (assuming adjacency order), then explores 2's neighbor 4.

2. Step 2: Backtrack and visit remaining neighbors

   After finishing 2 and 4, DFS backtracks to 1 and visits 3, then 3's neighbor 4 is already visited.

3. Final Answer:

   [1, 2, 4, 3] -> Option D

4. Quick Check:

   DFS order = deep first, backtrack [OK]

Hint: Follow neighbors deeply before backtracking [OK]

Common Mistakes:

• Visiting neighbors in wrong order
• Visiting node 4 twice
• Confusing BFS order with DFS

4. In a DFS implementation, what is the likely cause if the traversal gets stuck in an infinite loop?

medium

A. Starting from a disconnected node

B. Using a queue instead of a stack

C. Not marking nodes as visited

D. Graph has no edges

Solution

1. Step 1: Identify cause of infinite loop in DFS

   If nodes are not marked visited, DFS revisits the same nodes repeatedly causing infinite loops.

2. Step 2: Analyze other options

   Using a queue changes traversal type but doesn't cause infinite loops; disconnected nodes or no edges don't cause loops.

3. Final Answer:

   Not marking nodes as visited -> Option C

4. Quick Check:

   Missing visited marks cause loops [OK]

Hint: Always mark visited nodes to prevent loops [OK]

Common Mistakes:

• Blaming data structure choice for loops
• Ignoring visited marking importance
• Assuming disconnected nodes cause loops

5. You want to use DFS to detect if a directed graph has a cycle. Which approach correctly applies DFS for this task?

hard

A. Use DFS with a recursion stack to track nodes currently in the path

B. Use DFS and mark all nodes as visited once explored, ignoring recursion stack

C. Use BFS instead of DFS to detect cycles

D. Count edges and nodes; if edges > nodes, cycle exists

Solution

1. Step 1: Understand cycle detection in directed graphs

   DFS with a recursion stack tracks nodes in the current path to detect back edges indicating cycles.

2. Step 2: Evaluate other options

   Marking visited alone misses cycles; BFS is not ideal for cycle detection; counting edges vs nodes is insufficient.

3. Final Answer:

   Use DFS with a recursion stack to track nodes currently in the path -> Option A

4. Quick Check:

   Recursion stack in DFS detects cycles [OK]

Hint: Track recursion stack in DFS to find cycles [OK]

Common Mistakes:

• Ignoring recursion stack in cycle detection
• Using BFS for cycle detection in directed graphs
• Relying on edge/node count alone