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:
“If a man can write a better book, preach a better sermon, or make a better mouse-trap, than his neighbor, though he build his house in the woods, the world will make a beaten path to his door.”
—Ralph Waldo Emerson (18031882)
“I used to be a discipline problem, which caused me embarrassment until I realized that being a discipline problem in a racist society is sometimes an honor.”
—Ishmael Reed (b. 1938)