1 将顶点集V分成 S(开始只包含源点, S包含的点都是已经计算出最短路径的点) 和 V-S 集合(V-S 包含那些未确定最短路径的点)



2. 从V-S中选取这样一个顶点w: 满足经过S集合中任意顶点 v到w 的路径最短, 即

满足( 源到v的路径 + v到w的路径) 最小的那个w. 其中v 属于S, w属于S-V。将w 加入S, 并从V-S中移除w.



3. 如此反复，直到V-S变空集为止-1 to the vertex set V into S (the beginning contains only the source, S contains the points are already calculated the shortest path points) and set VS (VS contains the points that determined the shortest path) 2. From the VS select a vertex w: S set to meet through any vertex v shortest path to w that satisfy (the path of the source to the v+ v to w in the path of) the smallest one that w. v belong to S, w belongs to SV. The w added S, and removed from the VS w. 3. So repeatedly, until the empty set up VS