Publisher review:Dijkstra's algorithm for shortest paths script finds the shortest paths from the start vertex to all vertices nearer than or equal to the end. This script finds the shortest paths from the start vertex to all vertices nearer than or equal to the end.
The input graph G is assumed to have the following representation: A vertex can be any object that can be used as an index into a dictionary. G is a dictionary, indexed by vertices.
For any vertex v, G[v] is itself a dictionary, indexed by the neighbors of v. For any edge v->w, G[v][w] is the length of the edge.
Dijkstra's algorithm for shortest paths 1.0 is a Python script for Programming Methods and Algorithms scripts design by David Eppstein.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
Operating system:Windows / Linux / Mac OS / BSD / Solaris
Dijkstra's algorithm for shortest paths 1.0 script details 
