 |
COMBINATORICA PACKAGE SYMBOL
BellmanFord
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. 
works correctly even when the edge weights are negative, provided there are no negative cycles.
Details
- To use
, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
