Space-Efficient Hierholzer for Undirected Graphs

Elena Grigorescu Ziad Ismaili Alaoui Tamio-Vesa Nakajima Shayan Shirazi Mofrad Sebastian Wild
arXiv Code
The graph G
Step 1 / 1
Working graph
Algorithm graph visualization An interactive undirected multigraph showing the current phase of the algorithm.
Output graph
Eulerian tour written so far The same vertex set with each edge added as it is written to output.
Tour

Custom graph

Write one edge per line. Use 1 2 3 for three parallel copies, or 1 1 for a loop.

Use visual editor
The graph must be connected, with even degree at every vertex.