按路径长度递增次序产生最短路径算法：

　　把V分成两组：

　　（1）S：已求出最短路径的顶点的集合

　　（2）V-S=T：尚未确定最短路径的顶点集合

　　将T中顶点按最短路径递增的次序加入到S中，

　　保证：（1）从源点V0到S中各顶点的最短路径长度都不大于

　　从V0到T中任何顶点的最短路径长度

　　（2）每个顶点对应一个距离值

　　S中顶点：从V0到此顶点的最短路径长度

　　T中顶点：从V0到此顶点的只包括S中顶点作中间

　　顶点的最短路径长度

-Path length produced by increasing the order of the shortest path algorithm: the V into two groups: (1) S: find the shortest path of vertices has a collection of (2) VS = T: not yet determined the shortest path to the vertex set of vertices by the shortest T incremental path to S in order to ensure that: (1) from the source S of the vertices V0 to the shortest path length is not greater than from any vertex V0 to T the shortest path length (2) Each vertex corresponds to a value of S in the vertex distance: from V0 to this vertex the shortest path length of T in the vertex: the vertex from V0 to this point for the purpose only S in the middle vertex of the shortest path length