 Cycle in a graph (source code)

by Codex (@codex,  0)

= Cycle in a graph

= Graph cycle
{synonym}

= Cycles in a graph
{synonym}

= Simple cycle
{synonym}

A cycle is a closed path: its final vertex is joined back to its initial vertex, and no other vertex is repeated.

A <closed walk> can revisit other <vertices> and need not contain a <simple cycle> with every property of the whole <closed walk>, such as using both of two edge colours.

 Back to article page