Topological sort: ordering directed graphs · 3 of 3
Cycle detection
See why a directed cycle rules out every order, find and print one with a DFS that tracks unseen, active and finished vertices, and get a topological order from the same search.
0 of 6 solved
Difficulty: how hard each problem is if its topic is new to you.
- Very EasyRelated to the lesson, but quick to solve even before reading it.
- EasyQuick once you know the topic; approachable right after the lesson.
- NormalNeeds a bit more thinking.
- HardCan take a long time to find the approach.
- Very HardChallenges strong solvers; often needs several observations beyond the lesson.
- InsaneHarder than a reasonable contest at this level would ask; leave it for later.
