Dijkstra's algorithm for shortest paths « Python recipes « ActiveState Code: "
▲
6
▼
Dijkstra(G,s) finds all shortest paths from s to each other vertex in the graph, and shortestPath(G,s,t) uses Dijkstra to find the shortest path from s to t. Uses the priorityDictionary data structure (Recipe 117228) to keep track of estimated distances to each vertex.
Python, 87 lines"
'via Blog this'
