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:
“Do not, as some ungracious pastors do,
Show me the steep and thorny way to heaven,
Whilst like a puffed and reckless libertine
Himself the primrose path of dalliance treads,
And recks not his own rede.”
—William Shakespeare (1564–1616)
“Only in the problem play is there any real drama, because drama is no mere setting up of the camera to nature: it is the presentation in parable of the conflict between Man’s will and his environment: in a word, of problem.”
—George Bernard Shaw (1856–1950)