Essential algorithms for GCSE and A Level Computer Science
Routines that find satisfactory or optimum paths between vertices / nodes on a graph.
What is Dijkstra’s shortest path?
Dijkstra’s shortest path algorithm finds the shortest path between one node and all other nodes on a weighted graph. It is sometimes considered a special case of
the A* algorithm with no heuristics, although Edsger Dijkstra developed his algorithm first. It is also a type of breadth-first search.
A limitation of Dijkstra’s shortest path is that it doesn’t work for edges with a negative weight value. The Bellman–Ford algorithm later provided a solution to that problem.
What extra is in the book?
This algorithm / data structure has its own dedicated chapter in the book, which includes:
A hard copy of the book is available on our shop and a free PDF copy is included for all premium subscribers.