GraphsEvidence Contributing
Topological Sort
Order nodes of a DAG so every directed edge points from earlier to later, via DFS post-order or Kahn's algorithm.
Practice Problems: 3
Difficulty: 0 Easy·2 Medium·1 Hard
Core technique
Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.
- Core Strategy: Order nodes of a DAG so every directed edge points from earlier to later, via DFS post-order or Kahn's algorithm.