157. OCR A Level (H446) SLR26 – 2.3 Dijkstra’s shortest path

About this video

OCR Specification Reference
A Level 2.3.1f

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 questions:

- Do you understand how Dijkstra's shortest path algorithm works and can you trace its code to explain how it works?

00:00 Implementing Dijkstra's shortest path
00:08 Intro
00:13 Checklist
00:35 What is the Dijkstra's shortest path algorithm?
01:14 What are the applications of Dijkstra's shortest path?
01:33 Visualising Dijkstra's shortest path
02:57 Dijkstra's shortest path using structured English
03:28 Worked example
10:15 Practical example
11:19 Dijkstra's shortest path pseudocode
11:51 Worked example
17:16 Final thoughts
17:23 Alternative shortest paths
17:52 How do you set infinity?
19:27 Key question
19:40 Essential algorithms for A Level Computer Science text book
20:44 Outro

Last updated: 28.07.26

Other videos on this course