Hamiltonian path
English
A two-dimensional Hamiltonian path (also a Hamiltonian cycle)
Etymology
Named after William Rowan Hamilton (1805-1865), Irish mathematician.
Noun
Hamiltonian path (plural Hamiltonian paths)
- (graph theory) A path through a graph which visits each vertex exactly once.
- Hyponym: Hamiltonian cycle
Translations
path which visits each vertex exactly once
|
See also
Further reading
Hamiltonian path problem on Wikipedia.Wikipedia
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.