title: Walk all edges of an unidirected graph only once
body: <p>I am looking for an algorithm that would tell me if it is possible to walk all the edges of an unidirected graph only once. The algorithm would have to be able to start from any node and walk the entire graph without revisiting the same edge.</p>