1. 初使时令 S={V0},T={其余顶点}，T中顶点对应的距离值 　　若存在<V0,Vi>，d(V0,Vi)为<V0,Vi>弧上的权值 　　若不存在<V0,Vi>，d(V0,Vi)为∝ 　　2. 从T中选取一个其距离值为最小的顶点W且不在S中，加入S 　　3. 对T中顶点的距离值进行修改：若加进W作中间顶点，从V0到Vi的 　　距离值比不加W的路径要短，则修改此距离值 　　重复上述步骤2、3，直到S中包含所有顶点，即S=T为止-1 beginning of the season S = {V0}, T = {remaining vertices}, T in the vertex corresponding distance value if there <V0,Vi> , D (V0, Vi) for the <V0,Vi> If the weight of the arc on the existence of <V0,Vi> , D (V0, Vi) for the α 2. Select one from the T distance is the smallest of its vertices W and not in S, add S 3. The distance between the vertices of T values ??may be modified: if the middle vertex added to W , the distance from the value V0 to Vi W than the path without shorter, then modify this value from the Repeat 2 and 3 until S contains all vertices, that is S = T so far