Eulerian Circuit Finder
Hierholzer's Algorithm with Clear Layout
About Eulerian Circuits
An Eulerian circuit is a path in a graph that visits every edge exactly once and starts and ends at the same vertex.
Euler's Theorem: A connected graph has an Eulerian circuit if and only if every vertex has an even degree.
Click "Generate Graph" to begin
Hierholzer's Algorithm Steps:
- Choose any starting vertex
- Follow edges from the current vertex until you can't go further
- If you still have unused edges, find a vertex on your current path with unused edges
- Start a new path from this vertex, following unused edges until you return to it
- Splice this new path into your existing path
- Repeat until all edges are used