Combinatorica`
Combinatorica`

# 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 BellmanFord algorithm.
• The default is . 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.

# Examples

## Basic Examples(2)

ShortestPath has been superseded by FindShortestPath:

Wolfram Research (2012), ShortestPath, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html.

#### Text

Wolfram Research (2012), ShortestPath, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html.

#### CMS

Wolfram Language. 2012. "ShortestPath." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html.

#### APA

Wolfram Language. (2012). ShortestPath. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html

#### BibTeX

@misc{reference.wolfram_2024_shortestpath, author="Wolfram Research", title="{ShortestPath}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html}", note=[Accessed: 18-September-2024 ]}

#### BibLaTeX

@online{reference.wolfram_2024_shortestpath, organization={Wolfram Research}, title={ShortestPath}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html}, note=[Accessed: 18-September-2024 ]}