output = one of iterator, list, or set

Specifies what is returned from AllShortestPaths. The default is iterator.

AllShortestPaths(G, u, v) returns all shortest paths from u to v in a graph G.

The default output is an Iterator.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{C6}≔\mathrm{CycleGraph}\left(6\right)$

$\mathrm{C6}≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 6\; vertices\; and\; 6\; edges}$

$\mathrm{iter}≔\mathrm{AllShortestPaths}\left(\mathrm{C6}\,1\,4\right)$

$\mathrm{iter}≔\left[\begin{array}{c}\mathrm{Shortest\; Path\; Iterator}\end{array}\right]$

$$\begin{gathered} \mathbf{for}\mathrm{path}\mathbf{in}\mathrm{iter}\mathbf{do} \\ \mathrm{print}\left(\mathrm{path}\right) \\ \mathbf{end}\mathbf{do} \end{gathered}$$

$\left[1\,2\,3\,4\right]$

$\left[1\,6\,5\,4\right]$

$\mathrm{C23}≔\mathrm{CompleteGraph}\left(2\,3\right)$

$\mathrm{C23}≔\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 5\; vertices\; and\; 6\; edges}$

$\mathrm{AllShortestPaths}\left(\mathrm{C23}\,1\,2\,\mathrm{output}=\mathrm{set}\right)$

$\left\{\left[1\,3\,2\right]\,\left[1\,4\,2\right]\,\left[1\,5\,2\right]\right\}$

The GraphTheory[AllShortestPaths] command was introduced in Maple 2025.

For more information on Maple 2025 changes, see Updates in Maple 2025.