IsReachable returns true or false indicating whether there exists a path from u to v in the graph G.

To list all vertices reachable from u, use Reachable.

To produce an actual path from u to v, use BellmanFordAlgorithm, DijkstrasAlgorithm, or ShortestPath.

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

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

$\mathrm{C6}≔\mathrm{Graph\; 1:\; an\; undirected\; unweighted\; graph\; with\; 6\; vertices\; and\; 6\; edge(s)}$

$\mathrm{IsReachable}\left(\mathrm{C6}\,1\,5\right)$

$\mathrm{true}$

$\mathrm{ShortestPath}\left(\mathrm{C6}\,1\,5\right)$

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

The GraphTheory[IsReachable] command was introduced in Maple 2018.

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