DIJKstra最短路径

这里路径指两顶点间的通路，路径的长度指所有经过的边的总长。“最短路径”的问题指当两个顶点间通路多于一条时，如何找出边长总和为最短的那条。Dijkstra提出按路径长度递增的次序求最短路径的方法。-DIJKstra path here refers to the shortest path between two vertices of the path, the path length refers to all through the length of the edges. " Shortest path"　problem means that when more than one path between two vertices, how to find the sum of the shortest side length to which the. Dijkstra proposed an incremental path length according to the order of seeking the shortest path method.