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:
“Not once or twice in our rough island-story
The path of booty was the way to glory.”
—Anonymous.
“How much atonement is enough? The bombing must be allowed as at least part-payment: those of our young people who are concerned about the moral problem posed by the Allied air offensive should at least consider the moral problem that would have been posed if the German civilian population had not suffered at all.”
—Clive James (b. 1939)