Eulerian circuits

In graph theory, Eulerian circuits provide a way to traverse every edge of a graph exactly once and return to the starting vertex.