In combinatorics, an Eulerian cycle is a cycle in a graph whose edges are all of the edges of the graph.