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.
更多信息和选项
- 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.
范例
基本范例 (2)
ShortestPath has been superseded by FindShortestPath:
Wolfram Research (2012)，ShortestPath，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html.
文本
Wolfram Research (2012)，ShortestPath，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html.
CMS
Wolfram 语言. 2012. "ShortestPath." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html.
APA
Wolfram 语言. (2012). ShortestPath. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/ShortestPath.html 年