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.
Dijkstra
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.
Details and Options
- Dijkstra functionality is now available in the built-in Wolfram Language function FindShortestPath.
- To use Dijkstra, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Text
Wolfram Research (2012), Dijkstra, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/Dijkstra.html.
CMS
Wolfram Language. 2012. "Dijkstra." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/Dijkstra.html.
APA
Wolfram Language. (2012). Dijkstra. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/Dijkstra.html