#dfs

DFS:Finish Times, Recursion vs an Explicit Stack, and What a Cycle Looks Like

Walk a graph with DFS, stamp finish times, run the same walk on an ArrayDeque, and recognize a back edge as the shape of a cycle.

Read More →