(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 8 November 2010.
HTML page formatted Tue Dec 6 16:16:32 2011.
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. 8 November 2010. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/hamiltonianPath.html
