Dijstra算法

由Dijkstra提出的一种按路径长度递增序产生各顶点最短路径的算法。

（1）按路径长度递增序产生各顶点最短路径

　若按长度递增的次序生成从源点s到其它顶点的最短路径，则当前正在生成的最短路径上除终点以外，其余顶点的最短路径均已生成（将源点的最短路径看作是已生成的源点到其自身的长度为0的路径）。-Dijstra by Dijkstra algorithm proposed by an incremental path length of the sequence have vertex the shortest path algorithm. (1) by increasing the length of path of the generated sequence vertex if the shortest path length increases by the order generated from the source to other top s the shortest path point, the current generation is the shortest path apart from the end, the remaining vertices have the shortest path generation (source of the shortest path has been generated as the source of its own length of 0 Path).