Definition: A path through a graph that starts and ends at the same vertex and includes every other vertex exactly once.
Also known as tour.
Generalization (I am a kind of ...)
Specialization (... is a kind of me.)
See also Hamiltonian path, Euler cycle, vehicle routing problem, perfect matching.
Note: A Hamiltonian cycle includes each vertex once; an Euler cycle includes each edge once.
Also known as a Hamiltonian circuit.
Named for Sir William Rowan Hamilton (1805-1865).
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 26 December 2012.
HTML page formatted Wed Dec 26 09:31:43 2012.
Cite this as:
Paul E. Black, "Hamiltonian cycle", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 26 December 2012. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/hamiltonianCycle.html