Description: Dijkstra algorithm is a single-source shortest path problem solution greedy algorithm. The basic idea is to set the vertex set point set S and continue to make the greedy choice to expand the collection. A vertex belongs to the set S if and only if the vertex from the source to the length of the shortest path is known. Initially, S contains only source. Let u be the one of the vertices of G. The middle from the source to u and the only way through is called S in the vertex u from the source to the special path and Distance Records with an array corresponding to each vertex the shortest path length special. Dijkstra algorithm to remove time from the VS special way with the shortest length of the top accounting, Distance to records from the source to all other length of the shortest path between vertices.
To Search:
File list (Check if you may need any files):
第六章-单源最短路径\zuiduan.cpp
...................\readme.txt
...................\tempfile.exe
...................\zuiduan.exe
...................\zuiduan.obj
...................\tctemp.dat
第六章-单源最短路径
Download