用D[i]来表示当前从源到顶点i的最短特殊路径长度。假设u是G的某一顶点，把从源到u且中间只经过S中顶点的录称为从源到u的特殊路径，并用D数组记录当前每个顶点对应的最短特殊路径长度。Dijkstra算法每次从V-S中取出具有最短特殊路径长度的顶点u,将u添加到S中，同时对D数组作必要的修改。一旦S中包含了V中所有顶点，D就记录了从源到所有其它顶点之间的最短路径长度。-With D [i] to indicate the current node i from the source to the special shortest path length. Suppose u is a vertex of G, from the source to u and the middle after only vertices in S is called from a source to u recorded a special path and record the current use D array corresponds to each vertex of the shortest special path length. Dijkstra algorithm for each removed from the VS has the shortest path length special vertex u, u will be added to the S, while the D arrays make the necessary changes. Once S contains all the vertices of V, D on the record source to all other vertices from the shortest path length.