157. OCR A Level (H446) SLR26 – 2.3 Dijkstra’s shortest path
About this video
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.
Last updated: 28.02.25
Other videos on this course
-
155. OCR A Level (H446) SLR26 – 2.3 Implement merge sort
-
156. OCR A Level (H446) SLR26 – 2.3 Implement quick sort
-
158. OCR A Level (H446) SLR26 – 2.3 A star pathfinding
-
159. OCR A Level (H446) SLR26 – 2.3 A star pathfinding revisited
-
160. OCR A Level (H446) SLR26 – 2.3 Measures and methods to determine efficiency of algorithms