Dijkstra

Dijkstra[g, v]
gives a shortest-path spanning tree and associated distances from vertex

of graph

. 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.

To use Dijkstra, you first need to load the Combinatorica Package using Needs["Combinatorica`"].