>[!abstract] >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 (Wikipedia, 2024). Also see [[Brubaker, 2023|Brubaker (2023)]]. >[!related] >- **North** (upstream): — >- **West** (similar): [[Hamiltonian path]] >- **East** (different): — >- **South** (downstream): —