Shortest Distance Between Nodes
Perhaps someone can use this info...
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.
It looks like you're new here. If you want to get involved, click one of these buttons!