Better version of algorithm
Find minimum length matching of odd-degree vertices.
There’s an even number of them.
Find Eulerian tour of MST plus edges in matching.
Previous slide
Next slide
Back to first slide
View graphic version