An Eulerian path is any path in a graph that visits each and every link (or edge) exactly once.