FindCycle(G) returns a cycle in the graph G, if one exists, and otherwise returns the empty list.

FindCycle(G,v) returns a cycle in the graph G which includes the vertex v, if one such cycle exists, and otherwise returns the empty list.

FindCycle ignores self-loops.

All edges appearing in a cycle must be distinct.

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

$G≔\mathrm{CycleGraph}\left(3\,\mathrm{directed}\right)$

$G≔\mathrm{Graph\; 1:\; a\; directed\; graph\; with\; 3\; vertices\; and\; 3\; arcs}$

$\mathrm{DrawGraph}\left(G\right)$

$\mathrm{FindCycle}\left(G\right)$

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

$\mathrm{FindCycle}\left(G\,1\right)$

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

$T≔\mathrm{Graph}\left(5\,\left\{\left[1\,2\right]\,\left[1\,3\right]\,\left[3\,4\right]\,\left[3\,5\right]\right\}\right)$

$T≔\mathrm{Graph\; 2:\; a\; directed\; graph\; with\; 5\; vertices\; and\; 4\; arcs}$

$\mathrm{DrawGraph}\left(T\,\mathrm{style}=\mathrm{tree}\right)$

$\mathrm{FindCycle}\left(T\right)$

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

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