OCR A’LEVEL SLR26 Dijkstra’s shortest path

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.