(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) (a longer biography).
Author: PEB
Pablo Moscato's Hamiltonian Page with papers on many aspects of Hamiltonian cycles and paths.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 10 November 2008.
HTML page formatted Wed Feb 4 11:02:22 2009.
Cite this as:
Paul E. Black, "Hamiltonian path", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 10 November 2008. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/hamiltonianPath.html
