Back to algorithmsSredni
Topological Sort
Topological sort arranges vertices of a directed acyclic graph (DAG) in an order such that every edge goes from an earlier vertex to a later one.
O(V+E)O(V)OIJOI
🎮 Topological Sort — Games
Play both games to master the algorithm!
1
beginnerArrange the Order
Arrange graph vertices in a valid topological order. Simple mechanics — perfect to start with.
9 levels
2
advancedBuild a Schedule
Solve complex task scheduling problems on DAGs. More vertices, more challenges!
4 levels
💡
Tip: Start with Game 1 (easy version), then move to Game 2 (advanced).