topological sort

Depth-First Search: Cycles, Components, and Topological Order

BFS goes wide, DFS goes deep, and the difference is not stylistic. DFS answers questions about structure that a queue simply cannot see.

Problem Solving From Zero13