(definition)
Definition: A simple path through a graph that includes every vertex in the graph.
See also Hamiltonian cycle.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:04:34 2004.
HTML page formatted Wed Oct 26 09:47:35 2005.
Cite this as:
Paul E. Black, "Hamiltonian path", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/hamiltonianPath.html
