Give an algorithm to find in an undirected (connected) graph a path that goes through every edge exactly once in each direction.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.