Topological Order & DAGs

Kahn's algorithm and DFS post-order, cycle detection, counting orders, longest paths, and DP on a DAG.

0 / 4 solved

Question Tags Difficulty Success

1. Before and After

Algorithms

Easy 84%

2. Appended Too Early

topological-sortdfs +2

Medium —

3. Seventeen Minutes Of Work

dag-dplongest-path +2

Medium —

4. Alphabetical Build Order

topological-sortkahns-algorithm +2

Medium —

Learning Resources

cp-algorithms, Topological sorting

USACO Guide, Topological Sort

Jeff Erickson, Depth-First Search chapter

Up next

4 of 4 questions here are still unsolved.

Next module Shortest Paths