Topological Sort

Topological Sort orders nodes in a directed graph so every edge u -> v places u before v.

Key Ideas

• Works only for DAGs (directed acyclic graphs).
• Two common approaches: Kahn's algorithm (in-degrees) or DFS postorder.
• If you cannot process all nodes, there is a cycle.