A hamiltonian path in a graph is a path that passes through every vertex in the graph exactly once. A hamiltonain path does not necessarily pass through all the edges of the graph, however.
A hamiltonian path which ends in the same place in which it began is called a hamiltonian circuit or a hamiltonain cycle.
See also: Eulerian path.
