这个例程,会在多条相同最短路径中选出边数最少的路径.只是改变path域即可在遍历的时候访问到边数少的路径.核心的思想,就是建立一个数组,存放从出发点到当前顶点的最短路径边数.通过每次查看最短路径相同的情况, 即dv + cvw = dw.时,如果 Count[v] + 1 < Count[w]时,就执行 Count[w] = Count[v] + 1, 同时 w -> path = c.-This routine will be the same number of shortest paths in the selected path with the least number of edges. Just change the path traversal time domain can be accessed in the number of edges in the path less. The core idea is to create an array to store the starting point from The current number of edges in the shortest path vertices. by the shortest path each time you view the same situation, that is, dv+ cvw = dw., if Count [v]+ 1 < Count [w] when, on the implementation Count [w] = Count [ v]+ 1, while w->　path = c.