Better version of algorithm
Euler tours (Skiena, Section 8.4.6)
- An Euler tour in a graph is a tour of the graph that visits each edge exactly once.
- Well known that an undirected graph contains an Euler tour (or cycle) iff (1) it is connected and (2) each vertex has even degree.
- Easy to construct Euler tours efficiently.