AQA 7517 4.3.6.1: Dijkstra's shortest path algorithm
The free BugBot lessons that teach this point, a robot to try it on, and the past-paper questions that test it.
Lessons that teach it
- A5.7 Dijkstra's shortest path algorithm Algorithms and complexity
Tracing Dijkstra's algorithm in a table, why negative weights break it, a priority queue version, its efficiency and applications. - A5.9 Project: plan the route, then drive it Algorithms and complexity
Choose and justify a route planner, build the mat's graph, find the shortest route with Dijkstra's algorithm and drive it.
Try it on a robot
The task from A5.7 Dijkstra's shortest path algorithm, running here. Change the program and press Run.
The specification is AQA's own document; this page says which of our lessons teach point 4.3.6.1 and is not endorsed by the board.