GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/ShortestPath

GraphTheory

  

ShortestPath

  

find a shortest path between two vertices

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

ShortestPath(G, u, v)

Parameters

G

-

graph

u, v

-

vertices of the graph

Description

• 

ShortestPath returns a shortest path from u to v in G using a breadth-first search. The output is a list of vertices in the order they appear on the path. If no such a path exists, an error message is displayed.

• 

Edge weights are ignored.

• 

To compute shortest paths with respect to edge weights, use either DijkstrasAlgorithm or BellmanFordAlgorithm.

Examples

withGraphTheory:

C6CycleGraph6

C6Graph 1: an undirected unweighted graph with 6 vertices and 6 edge(s)

(1)

IsReachableC6,1,5

true

(2)

ShortestPathC6,1,5

1,6,5

(3)

See Also

BellmanFordAlgorithm

DijkstrasAlgorithm

Distance