Description: Dijkstra (dijkstra) algorithm to solve from a source point to the rest of the nodes in the shortest path. From the nested loop can easily get this algorithm s time complexity is o (n ^ 2). This is an order of increasing path length according to the shortest path algorithm generated.
Dijkstra s algorithm, seeking a directed network G, v0 vertex to vertex v the rest of the shortest path P [v] and with the right length D [v]. P [v] value of the subscript precursor vertex,
D [v] v0 to v represents the shortest path length.
To Search:
File list (Check if you may need any files):
07最短路径_Dijkstra.c
Download