Description: First of all, the introduction of an auxiliary vector D, for each of its component D that found by the current from the starting point v to each end of the length of the shortest path vi. If D [3] = 2, said from the beginning point of the path of v to the end of three relative minimum length of 2. Emphasize here that in the algorithm process of the relative value of D is closer and closer to the final result, but in the process does not necessarily mean that the shortest path length. Its initial state: If there are arcs from v to vi, then the D value for the arc on the right otherwise set D is ∞. Clearly, the length of D [j] =
To Search:
File list (Check if you may need any files):
shortestpath.cpp
Download