Eulerian cycle

Definition

A eulerian cycle is an ordinary cycle in a directed or undirected graph that contains each edge/arc exactly once.

Input

A strongly connected directed or connected undirected graph.

Output

A eulerian cycle as an alternating sequence of nodes and edges/arcs or, alternatively, the (correct) message that no such cycle exists.

Known algorithms

Classical eulerian cycle algorithm