Title:
Monophyletic-shortest-path
Download
Description: Dijkstra proposed by the vertex and the path between the source point v in increasing order of length, to generate the shortest path to each vertex the algorithm. Both first find the shortest length of a shortest path, then it is calculated with reference to a short length of time the shortest path, and so on, until the point from the source vertex v to each other all the calculate the shortest path so far.
To Search:
File list (Check if you may need any files):
最短路径（distr算法）.cpp
