Eulerian cycle: Difference between revisions
Jump to navigation
Jump to search
(→Output) |
|||
| Line 9: | Line 9: | ||
== Output == | == Output == | ||
A | A eulerian cycle as an alternating sequence of nodes and edges/arcs or, alternatively, the (correct) message that no such cycle exists. | ||
== Known algorithms == | == Known algorithms == | ||
[[Classical eulerian cycle algorithm]] | [[Classical eulerian cycle algorithm]] | ||
Revision as of 10:55, 7 November 2014
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.