Definition:Eulerian Trail

An Eulerian path is a path $$P$$ that passes through every vertex of a graph $$G$$ and uses every edge of $$G$$ exactly once.

Such a path is said to traverse $$G$$.

Compare Eulerian circuit.