In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path or a Hamiltonian cycle exists in a given graph (whether directed or undirected). Both problems are NP-complete.
Read more about Hamiltonian Path Problem: Relation Between Problems, Algorithms, Complexity
Famous quotes containing the words path and/or problem:
“Tired,
she looked up the path
her lover would take
as far as her eyes could see.
On the roads,
traffic ceased
at the end of day
as night slid over the sky.
The traveller’s pained wife
took a single step towards home,
said, “Could he not have come at this instant?”
and quickly craning her neck around,
looked up the path again.”
—Amaru (c. seventh century A.D.)
“A curious thing about the ontological problem is its simplicity. It can be put in three Anglo-Saxon monosyllables: ‘What is there?’ It can be answered, moveover, in a word—‘Everything.’”
—Willard Van Orman Quine (b. 1908)