WOLFRAM

Wolfram Language & System Documentation Center

GraphPath[g,start,end]

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

更多信息和选项
Details and Options Details and Options
范例  
基本范例  
Options  
Method  
Properties & Relations  
Possible Issues  
Interactive Examples  
参见
技术笔记
相关指南
按以下格式引用：
GraphUtilities`
GraphUtilities`

GraphPath

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »

GraphPath[g,start,end]

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

更多信息和选项

范例

打开所有单元 关闭所有单元

基本范例  (2)

This defines a small directed graph:

This finds the shortest path from vertex 1 to vertex 3:

This finds the shortest path from vertex 1 to vertex 3, ignoring the edge weights:

GraphPath has been superseded by FindShortestPath:

Options  (1)

Method  (1)

This defines a small graph:

Because of the negative edge weight, the Dijkstra algorithm cannot be applied:

The Bellman–Ford algorithm works:

This defines a small graph with a negative cycle:

The Dijkstra algorithm does not work for negative edge weights:

The Bellman–Ford algorithm detects a negative weight cycle:

The default algorithm for graphs with negative edge weights is Bellman–Ford:

Properties & Relations  (1)

This defines a small directed graph:

This finds the shortest path from vertex 1 to 3:

This finds the distance of this path, taking into account the edge weights:

This finds the distance of this path, ignoring the edge weights:

Possible Issues  (1)

This defines a small directed graph:

If there are negative edge weights, the "Dijkstra" method cannot be used:

This finds the shortest path from vertex 1 to vertex 3 using the "BellmanFord" method:

Interactive Examples  (1)

This shows how to travel from vertex 1 to 7 through the shortest path:

Wolfram Research (2007)，GraphPath，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/GraphPath.html.

文本

Wolfram Research (2007)，GraphPath，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/GraphPath.html.

CMS

Wolfram 语言. 2007. "GraphPath." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/GraphPath.html.

APA

Wolfram 语言. (2007). GraphPath. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/GraphPath.html 年

BibTeX

@misc{reference.wolfram_2025_graphpath, author="Wolfram Research", title="{GraphPath}", year="2007", howpublished="\url{https://reference.wolfram.com/language/GraphUtilities/ref/GraphPath.html}", note=[Accessed: 15-September-2025]}

BibLaTeX

@online{reference.wolfram_2025_graphpath, organization={Wolfram Research}, title={GraphPath}, year={2007}, url={https://reference.wolfram.com/language/GraphUtilities/ref/GraphPath.html}, note=[Accessed: 15-September-2025]}