Module 6 · Dijkstra's Algorithm (optional)
Module 6 · Dijkstra's Algorithm (Optional) — Knowledge ChecksAnswer key
On a grid where every segment takes the same time, how do BFS and Dijkstra's algorithm compare?
With every segment costing 1, fewest steps and least cost are the same thing, so the two agree on every test. The slow segment is what separates them.