An
**
Eulerian path
**
is a traversal of a graph in which every
*
edge
*
is traversed precisely once.

A
**
Hamiltonian path
**
is a traversal of a graph in which every
*
vertex
*
is visited precisely once.