What is a common mistake in Graph Traversal, Cycle Detection and Topological Sort?

Question

What is a common mistake in Graph Traversal, Cycle Detection and Topological Sort?

Option A — Correct answer

Using undirected cycle logic for directed graphs

Option B

Writing a small dry run

Option C

Naming the pattern

Option D

Testing a boundary case

Explanation

This is the most likely implementation risk for this chapter.

Quiz: Graph Traversal, Cycle Detection and Topological Sort