BellmanFord

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

BellmanFord[g,v]

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. BellmanFord works correctly even when the edge weights are negative, provided there are no negative cycles.