Lesson 2 of 6
DFS: depth-first discovery and return order
Follow one path as far as it goes, step back, and use the search to find reachable vertices, count components, two-color a graph and detect cycles.
0 of 13 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.
