Definition: A simple path through a graph that includes every vertex in the graph.
Generalization (I am a kind of ...)
See also Hamiltonian cycle.
Note: Named for Sir William Rowan Hamilton (1805-1865).
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 26 December 2012.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "Hamiltonian path", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 26 December 2012. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/hamiltonianPath.html