✳flâneur — a map of the web's best reading

Eulerian path

en.wikipedia.org · 4,079 words · saved by 1 readers

In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices). Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. The problem can be stated mathematically like this:

Eulerian path - Wikipedia Jump to content From Wikipedia, the free encyclopedia Trail in a graph that visits each edge once Multigraphs of both Königsberg Bridges and Five room puzzles have more than two odd vertices (in orange), thus are not Eulerian and hence the puzzles have no solutions. Every vertex of this graph has an even degree. Therefore, this is an Eulerian graph. Following the edges in alphabetical order gives an Eulerian circuit/cycle. In graph theory , an Eulerian trail (or Eulerian path ) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting v

Explore this link on the map →

related reading