The Euler Path is a very popular technique which is used to solve puzzles, other problems in Engineering. The question is, is it possible to trace through all the edges with a condition, that an edge can be traced only once, but vertices can be traced any number of times??