Important: The networks package has been deprecated.  Use the superseding command GraphTheory[CycleGraph] instead.

This procedure returns a graph that is an undirected cycle with n vertices and edges.

This routine is normally loaded by using the command with(networks), but it may also be referenced by using the full name networks[cycle](...).

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

$G≔\mathrm{cycle}\left(6\right)\:$

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

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