Introduction - If you have any usage issues, please Google them yourself
(2) the principal on the basic idea : onto analysis from the topics I think this is a map of the shortest path problem. It decided to use Dijkstra algorithm by increasing the path length of the order gradually emerge from the shortest path approach : set up two vertices of the pool T and S, S storage pools have found the shortest path to the peak, Set T has not kept current to find the shortest path to the peak. Initial state, the pool S contain only source V0. and then from the pool of selected T vertex V0 shortest path length of the apex into pools S, S pool each add a new peak U, vertex V0 be changed to pool the remaining vertices T is the shortest path length value, Set T vertices new shortest path length of the original value of the shortest path length and value of the vertex U short