Graphs 0/61

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.

4,838 words · 22 min read

Difficulty: how hard each problem is if its topic is new to you.

Core 5

Additional practice 5