Eulerian cycle: Difference between revisions
Jump to navigation
Jump to search
(Created page with "== 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 th...") |
(→Output) |
||
| Line 11: | Line 11: | ||
== Output == | == Output == | ||
A Eulerian cycle as an alternating sequence of nodes and edges/arcs. | 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 09:22, 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 directed or 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.