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

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.

BibTeX

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

BibLaTeX

@online{reference.wolfram_2020_shortestpath, organization={Wolfram Research}, title={ShortestPath}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html}, note=[Accessed: 03-December-2020 ]}

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