Eulerian cycle: Difference between revisions
Jump to navigation
Jump to search
(→Output) |
(→Input) |
||
| Line 7: | Line 7: | ||
== Input == | == Input == | ||
A directed or undirected graph. | A strongly connected directed or connected undirected graph. | ||
== Output == | == Output == | ||
Revision as of 09:51, 12 October 2014
Definition
A Eulerian cycle is a cycle in a directed or undirected graph that contains each edge/arc exactly once.
Redundant information for clarification: In the directed case, each arc must have forward orientatin on the cycle.
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.