A Euler tour or Eulerian tour in an undirected graph is a tour/ path that traverses each edge of the graph exactly once. Graphs that have a Euler tour are called Eulerian graphs.
Refer the article for more details and implementations.
Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/what-is-a-euler-or-eulerian-tour/
opengenus (Team) #1