# Hamilton path

A Hamilton path, named after William Hamilton, is a path that traverses
every vertex of a connected graph once and only once. The problem of the knight's
tour is equivalent to finding a Hamilton path (or, in the case, of a
reentrant tour, i.e. one that starts and ends on the same vertex, a **Hamilton circuit**)
that corresponds to the legal moves of the knight. Compare with Euler
path. See also traveling
salesman problem.