Cycle detection in graphs in Data Structures Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a cycle in a graph?

A cycle is a path in a graph where the first and last vertices are the same, and no edges or vertices are repeated except the starting/ending vertex.

beginner

Why is cycle detection important in graphs?

Detecting cycles helps identify problems like infinite loops, deadlocks, or inconsistencies in networks, scheduling, and dependency management.

intermediate

Name two common methods to detect cycles in graphs.

Depth-First Search (DFS) with recursion stack and Union-Find (Disjoint Set) are two common methods to detect cycles.

intermediate

How does DFS help detect cycles in a directed graph?

DFS tracks nodes in the current path using a recursion stack. If it revisits a node in this stack, a cycle exists.

intermediate

What is the difference in cycle detection between directed and undirected graphs?

In undirected graphs, a cycle is detected if a visited node is found again and it is not the parent node. In directed graphs, cycles are detected by revisiting nodes in the current recursion path.

What does a cycle in a graph mean?

A A path with no edges

B A path that starts and ends at the same vertex without repeating edges or vertices

C A path that never returns to the starting vertex

D A path that visits every vertex exactly once

A cycle is a path that starts and ends at the same vertex without repeating edges or vertices except the start/end vertex.

Which algorithm uses a recursion stack to detect cycles in directed graphs?

A Depth-First Search

B Breadth-First Search

C Dijkstra's Algorithm

D Kruskal's Algorithm

Depth-First Search uses a recursion stack to track nodes in the current path and detect cycles in directed graphs.

In an undirected graph, a cycle is detected if a visited node is found again and it is not the ____.

A child node

B root node

C parent node

D leaf node

In undirected graphs, revisiting a visited node that is not the parent indicates a cycle.

Which data structure is commonly used in cycle detection with Union-Find method?

A Linked List

B Queue

C Stack

D Disjoint Set

Union-Find uses Disjoint Set data structure to detect cycles by checking if two vertices belong to the same set.

Why is cycle detection important in dependency management?

A To avoid infinite loops and conflicts

B To speed up processing

C To reduce memory usage

D To increase network speed

Cycle detection prevents infinite loops and conflicts in dependencies, ensuring proper order and consistency.

Explain how Depth-First Search can be used to detect cycles in a directed graph.

Think about how DFS keeps track of nodes it is currently exploring.

Describe the difference between cycle detection in directed and undirected graphs.

Consider how edge direction affects revisiting nodes.

Practice

1. What is the main purpose of cycle detection in a graph?

easy

A. To count the number of nodes

B. To find if there is a loop in the graph

C. To sort the nodes in ascending order

D. To find the shortest path between nodes

Solution

1. Step 1: Understand the concept of cycle detection

   Cycle detection checks if a graph contains any loops where you can start at a node and return to it by following edges.

2. Step 2: Identify the main goal

   The main goal is to find if such loops exist, which can cause problems like infinite loops in algorithms.

3. Final Answer:

   To find if there is a loop in the graph -> Option B

4. Quick Check:

   Cycle detection = find loops [OK]

Hint: Cycle detection means finding loops in graphs [OK]

Common Mistakes:

• Confusing cycle detection with sorting
• Thinking it counts nodes instead of finding loops
• Assuming it finds shortest paths

2. Which data structure is commonly used to detect cycles in a directed graph using DFS?

easy

A. Queue

B. Stack

C. Hash Set to track recursion stack

D. Priority Queue

Solution

1. Step 1: Recall DFS cycle detection method

   DFS explores nodes deeply and uses a recursion stack to track nodes currently in the path.

2. Step 2: Identify the data structure used

   A hash set or boolean array is used to track nodes in the recursion stack to detect back edges indicating cycles.

3. Final Answer:

   Hash Set to track recursion stack -> Option C

4. Quick Check:

   DFS cycle detection uses recursion stack tracking [OK]

Hint: Use a hash set to track nodes in current DFS path [OK]

Common Mistakes:

• Using queue instead of stack for DFS
• Not tracking recursion stack nodes
• Confusing with BFS cycle detection

3. Consider the directed graph edges: [(1, 2), (2, 3), (3, 4), (4, 2)]. Does this graph contain a cycle?

medium

A. Yes, there is a cycle involving nodes 2, 3, and 4

B. Yes, but only between nodes 1 and 2

C. No, it is acyclic

D. No, because node 1 has no incoming edges

Solution

1. Step 1: Trace the edges to find cycles

   Edges form path 1->2->3->4 and then 4->2, which loops back to node 2.

2. Step 2: Identify the cycle nodes

   The cycle is formed by nodes 2, 3, and 4 because you can go from 2 to 3 to 4 and back to 2.

3. Final Answer:

   Yes, there is a cycle involving nodes 2, 3, and 4 -> Option A

4. Quick Check:

   Edges 4->2 create cycle 2-3-4 [OK]

Hint: Look for edges that point back to earlier nodes [OK]

Common Mistakes:

• Ignoring the edge 4->2 that closes the cycle
• Thinking node 1's edges affect cycle
• Assuming no cycle if start node has no incoming edges

4. Given this DFS-based cycle detection pseudocode, what is the error?

function dfs(node):
  visited[node] = true
  for neighbor in graph[node]:
    if visited[neighbor]:
      return true
    if dfs(neighbor):
      return true
  return false

medium

A. It does not track nodes in the current recursion stack

B. It marks nodes as visited too late

C. It should use a queue instead of recursion

D. It returns false too early

Solution

1. Step 1: Analyze the visited marking

   The code marks nodes as visited but does not distinguish between nodes visited in current path and fully processed nodes.

2. Step 2: Identify missing recursion stack tracking

   Without tracking nodes in the current recursion stack, it cannot detect back edges properly, causing false negatives.

3. Final Answer:

   It does not track nodes in the current recursion stack -> Option A

4. Quick Check:

   Missing recursion stack tracking causes wrong cycle detection [OK]

Hint: Track recursion stack separately to detect cycles [OK]

Common Mistakes:

• Using only visited array without recursion stack
• Confusing visited with recursion stack
• Thinking recursion depth causes error

5. You have a task scheduling system represented as a directed graph where edges mean "task A must finish before task B starts." How can cycle detection help in this system?

hard

A. It counts the total number of tasks

B. It finds tasks that can run in parallel

C. It sorts tasks by their duration

D. It detects impossible schedules due to circular dependencies

Solution

1. Step 1: Understand task scheduling graph meaning

   Edges show dependencies; a cycle means tasks depend on each other in a loop.

2. Step 2: Identify the role of cycle detection

   If a cycle exists, the schedule is impossible because tasks wait on each other endlessly.

3. Final Answer:

   It detects impossible schedules due to circular dependencies -> Option D

4. Quick Check:

   Cycle detection finds circular dependencies [OK]

Hint: Cycles mean tasks depend on each other endlessly [OK]

Common Mistakes:

• Thinking cycle detection sorts tasks
• Assuming cycles allow parallel tasks
• Confusing cycle detection with counting tasks