Variation on Hamiltonian path problems

Question

Thinking about if we modify the definition of Hamiltonian path as we need to go through every edge once,but can pass vertex any times,is there still an algorithm available? How should I modify the original Hamiltonian algorithm to account for this?

Answer 1

You're describing a Eulerian path. You can find such paths with Fleury's algorithm.