Description: With D [i] to indicate the current node i from the source to the special shortest path length. Suppose u is a vertex of G, from the source to u and the middle after only vertices in S is called from a source to u recorded a special path and record the current use D array corresponds to each vertex of the shortest special path length. Dijkstra algorithm for each removed from the VS has the shortest path length special vertex u, u will be added to the S, while the D arrays make the necessary changes. Once S contains all the vertices of V, D on the record source to all other vertices from the shortest path length.
To Search:
File list (Check if you may need any files):
Dijkstra.doc
Download