BFS: breadth-first layers and shortest routes · 1 of 1
Breadth-first search
Use a first-in-first-out queue to visit vertices in distance layers and find fewest-move routes in graphs, grids and puzzle states.
0 of 10 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.
