ShortestPath

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

ShortestPath[g,start,end]

finds a shortest path between vertices start and end in graph g.

Details and Options

ShortestPath functionality is now available in the built-in Wolfram Language function FindShortestPath.
To use ShortestPath, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
An option Algorithm that takes on the values Automatic, Dijkstra, or BellmanFord is provided. This allows a choice between using Dijkstra's algorithm and the Bellman–Ford algorithm.
The default is Algorithm->Automatic. In this case, depending on whether edges have negative weights and depending on the density of the graph, the algorithm chooses between BellmanFord and Dijkstra.

Wolfram Language code: Needs["Combinatorica`"]

Wolfram Language code: g = FromAdjacencyMatrix[{{0, 1, 1, 1}, {1, 0, 1, 0}, {1, 1, 0, 1}, {1, 0, 1, 0}}];

Wolfram Language code: ShowGraph[g]

Wolfram Language code: ShortestPath[g, 1, 2]

ShortestPath has been superseded by FindShortestPath:

Wolfram Language code: g = AdjacencyGraph[{{0, 1, 1, 1}, {1, 0, 1, 0}, {1, 1, 0, 1}, {1, 0, 1, 0}}]

Wolfram Language code: FindShortestPath[g, 1, 2]

Top