Let G be an undirected graph with n vertices and m edges. Describe an O(n+m)- time algorithm for traversing each edge of G exactly once in each direction.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.