Cycle Detection in Directed Graph in DSA Typescript - Execution Trace

Concept Flow - Cycle Detection in Directed Graph

Start at each unvisited node

↓

Mark node as visited and in recursion stack

↓

For each neighbor

↓

If neighbor not visited

→Recurse DFS on neighbor

↓

If neighbor in recursion stack

→Cycle detected

↓

After all neighbors checked

↓

Remove node from recursion stack

↓

Continue with next node or end

Start DFS from each node, track visited and recursion stack to detect back edges indicating cycles.

Execution Sample

DSA Typescript

function dfs(node) {
  visited[node] = true;
  recStack[node] = true;
  for (let neighbor of graph[node]) {
    if (!visited[neighbor] && dfs(neighbor)) return true;
    else if (recStack[neighbor]) return true;
  }
  recStack[node] = false;
  return false;
}

DFS visits nodes, marks recursion stack, detects cycle if neighbor is in recursion stack.

Execution Table

Step	Operation	Current Node	Visited Set	Recursion Stack	Action	Cycle Detected	Graph State
1	Start DFS	A	{}	{}	Mark A visited and in stack	No	A->B, B->C, C->A
2	Visit neighbor B	B	{A}	{A}	Mark B visited and in stack	No	A->B, B->C, C->A
3	Visit neighbor C	C	{A,B}	{A,B}	Mark C visited and in stack	No	A->B, B->C, C->A
4	Visit neighbor A	A	{A,B,C}	{A,B,C}	A is in recursion stack	Yes	Cycle detected: A->B->C->A
5	Return true up call stack	C	{A,B,C}	{A,B,C}	Cycle found, stop DFS	Yes	Cycle detected
6	Return true up call stack	B	{A,B,C}	{A,B,C}	Cycle found, stop DFS	Yes	Cycle detected
7	Return true up call stack	A	{A,B,C}	{A,B,C}	Cycle found, stop DFS	Yes	Cycle detected

💡 Cycle detected when visiting node A again while it is in recursion stack

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	After Step 4	Final
visited	{}	{A}	{A,B}	{A,B,C}	{A,B,C}	{A,B,C}
recStack	{}	{A}	{A,B}	{A,B,C}	{A,B,C}	{A,B,C}
currentNode	null	A	B	C	A	A
cycleDetected	false	false	false	false	true	true

Key Moments - 3 Insights

Why do we check if a neighbor is in the recursion stack to detect a cycle?

Because a neighbor in the recursion stack means we found a back edge to an ancestor node in the current DFS path, indicating a cycle (see step 4 in execution_table).

Why do we remove a node from the recursion stack after visiting all neighbors?

Removing the node means we finished exploring all paths from it, so it is no longer in the current DFS path. This prevents false cycle detection later (implied after step 4).

What happens if a node is already visited but not in recursion stack?

It means the node was fully explored in a previous DFS call and no cycle was found through it, so we skip it safely (seen in step 3 when checking neighbors).

Visual Quiz - 3 Questions

Look at the execution_table, what is the recursion stack after step 3?

A {A}

B {A,B,C}

C {A,B}

D {}

💡 Hint

Check the 'Recursion Stack' column at step 3 in execution_table

At which step does the cycle get detected?

A Step 2

B Step 4

C Step 6

D Step 7

💡 Hint

Look for 'Cycle Detected' column showing 'Yes' in execution_table

If the graph had no cycle, what would happen to the recursion stack after DFS finishes on a node?

A It becomes empty for that node's DFS call

B It contains only the last visited node

C It remains with all nodes visited

D It contains nodes not visited yet

💡 Hint

Recall key moment about removing node from recursion stack after visiting neighbors

Concept Snapshot

Cycle Detection in Directed Graph using DFS:
- Use two sets: visited and recursion stack
- Start DFS from each unvisited node
- Mark node visited and add to recursion stack
- For each neighbor:
  - If not visited, recurse DFS
  - If in recursion stack, cycle found
- Remove node from recursion stack after all neighbors
- If cycle found anywhere, graph has a cycle

Full Transcript

Cycle detection in a directed graph uses depth-first search (DFS). We keep track of nodes visited and nodes currently in the recursion stack (the current path). Starting from each unvisited node, we mark it visited and add it to the recursion stack. For each neighbor, if it is not visited, we recurse DFS on it. If the neighbor is already in the recursion stack, it means we found a cycle. After exploring all neighbors, we remove the node from the recursion stack. The process repeats until all nodes are checked or a cycle is found. The execution table shows step-by-step how nodes are visited, recursion stack updated, and cycle detected when a back edge is found.