Dijkstra’s Algorithm

From: Wikipedia

An algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.