Description: The issue of the shortest path problem as a unit, find a directed graph between two points of the path of minimum weight. Dijkstra algorithm requires no power to map the edge value is negative, the information to the map by an adjacency list to represent an additional set of each vertex is an attribute d [v], described from the source point to the most short-circuit v on the right by the upper bound value. Algorithm to set up a vertex set S, repeatedly choose the shortest path with the vertex is estimated u ∈ VS, will u join the S, the algorithm is also used in the vertex of the smallest priority queues, sorting for the vertex of the d keyword value.
File list (Check if you may need any files):
Dijkstra算法.doc
Download