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:
“... my aim is now, as it has been for the past ten years, to make myself a true woman, one worthy of the name, and one who will unshrinkingly follow the path which God marks out, one whose aim is to do all of the good she can in the world and not be one of the delicate little dolls or the silly fools who make up the bulk of American women, slaves to society and fashion.”
—Ellen Henrietta Swallow Richards (1842–1911)
“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)