Eulerian path
trail in a finite graph which visits every edge exactly once From Wikipedia, the free encyclopedia
Eulerian path is a notion from graph theory. A eulerian path in a graph is one that visits each edge of the graph once only. A Eulerian circuit or Eulerian cycle is an Eulerian path which starts and ends on the same vertex.
Wikiwand - on
Seamless Wikipedia browsing. On steroids.