(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
Links to 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 14 September 2006.
HTML page formatted Thu Sep 14 10:28:07 2006.
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. 14 September 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/hamiltonianPath.html
