Dijkstra's Algorithm finds the shortest path between two points. Dr Mike Pound explains how it works.
