NIST

Hamiltonian path

(definition)

Definition: A simple path through a graph that includes every vertex in the graph.

Generalization (I am a kind of ...)
simple path.

See also Hamiltonian cycle.

Note: Named for Sir William Rowan Hamilton (1805-1865).

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 26 December 2012.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "Hamiltonian path", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 26 December 2012. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/hamiltonianPath.html