文件名称:(Dijkstra)-a-shortest-path-algorithm
介绍说明－－下载内容均来自于网络，请自行研究使用
大概流程如下：
初始对每个点e，令v[e]=0，dis[e]=inf
令起点dis[s]=0
每次找出p，使得v[p]=0，并且dis[p]最小
令v[p]=1
对每个和p相邻的q，用dis[p]+distance[p,q]去更新dis[q]
直到找不到v[p]=0-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
初始对每个点e，令v[e]=0，dis[e]=inf
令起点dis[s]=0
每次找出p，使得v[p]=0，并且dis[p]最小
令v[p]=1
对每个和p相邻的q，用dis[p]+distance[p,q]去更新dis[q]
直到找不到v[p]=0-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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
狄克斯特拉(Dijkstra)最短路径算法.cpp