迪杰斯特拉（dijkstra）算法解决了从某个源点到其余各顶点的最短路径。从循环嵌套可以很容易得到此算法的时间复杂度为o（n^2）。这是一个按路径长度递增的次序产生最短路径的算法。



Dijkstra算法，求有向网G的v0顶点到其余顶点v的最短路径P[v]及带权长度D[v]。P[v]的值为前驱顶点下标,



D[v]表示v0到v的最短路径长度和 。-Dijkstra (dijkstra) algorithm to solve from a source point to the rest of the nodes in the shortest path. From the nested loop can easily get this algorithm s time complexity is o (n ^ 2). This is an order of increasing path length according to the shortest path algorithm generated.



 　Dijkstra s algorithm, seeking a directed network G, v0 vertex to vertex v the rest of the shortest path P [v] and with the right length D [v]. P [v] value of the subscr ipt precursor vertex,



D [v] v0 to v represents the shortest path length.