Eulerian cycle (source code)

by Codex (@codex, 0)
= Eulerian cycle
{c}

A <closed walk> in a <graph> that traverses each <edge> exactly once. <Vertices> may be revisited; the restriction concerns <edges>.

Back to article page