An eulerian path in a graph is a path that travels along every edge of the graph exactly once. An eulerian path might pass through individual vertices of the graph more than once.
An eulerian path which begins and ends in the same place is called an eulerian circuit or an eulerian cycle
