AQA A’Level SLR05 Dijkstra’s shortest path
About this video
AQA Specification Reference
A Level 4.3.6.1
Dijkstra's shortest path is an algorithm which allows you to work out the shortest path between one particular start node and all the other nodes in a weighted graph.
Key question:
- Do you understand how Dijkstra's shortest path algorithm works, and can you trace its code to explain how it works?
00:00 Dijkstra's shortest path
00:12 Intro
00:17 What is Dijkstra's shortest path algorithm?
00:53 What are the applications of Dijkstra's shortest path?
01:13 Visualising Dijkstra's shortest path
02:37 Dijkstra's shortest path using structured English
03:10 Worked example
09:05 Practical example
10:08 Dijkstra's shortest path pseudocode
10:40 Worked example 2
15:55 Final thoughts
15:59 Alternative shortest paths (T -> G -> S)
16:28 How do you set infinity?
17:59 Key question
18:13 Essential algorithms and data structures text book
19:01 Outro
Last updated: 15.04.25
