This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)

Dijkstra


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