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:

“The purifying, healing influence of literature, the dissipating of passions by knowledge and the written word, literature as the *path* to understanding, forgiveness and love, the redeeming might of the word, the literary spirit as the noblest manifestation of the spirit of man, the writer as perfected type, as saint.”

—Thomas Mann (1875–1955)

“Theology, I am persuaded, derives its initial impulse from a religious wavering; for there is quite as much, or more, that is mysterious and calculated to awaken scientific curiosity in the intercourse with God, and it [is] a *problem* quite analogous to that of theology.”

—Charles Sanders Peirce (1839–1914)