Wolfram Language & System 10.4 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)


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

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.