Dijkstra

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

Dijkstra[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. Dijkstra does not work correctly when the edge weights are negative; BellmanFord should be used in this case.

DetailsDetails