Title:
(Dijkstra)-a-shortest-path-algorithm
Download
Description: Probably process is as follows:
For every dot e, initial [e] to v = 0, dis [e] = inf
Make starting point dis [s] = 0
Each find p, makes v [p] = 0, and dis [p] the smallest
Make v [p] = 1
Adjacent to each and p (q), with dis [p]+ distance [p, q] to update the dis [q]
Until find v [p] = 0
To Search:
File list (Check if you may need any files):
狄克斯特拉(Dijkstra)最短路径算法.cpp
