 |
Dijkstra
gives a shortest-path spanning tree and associated distances from vertex v of graph g. The shortest-path spanning tree is given by a list in which element 
is the predecessor of vertex 
in the shortest-path spanning tree. 
does not work correctly when the edge weights are negative; BellmanFord should be used in this case.
更多信息
- To use
, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
