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:

“For I must tell you that we artists cannot tread the *path* of Beauty without Eros keeping company with us and appointing himself as our guide.”

—Thomas Mann (1875–1955)

“War is not a life: it is a situation,

One which may neither be ignored nor accepted,

A *problem* to be met with ambush and stratagem,

Enveloped or scattered.”

—T.S. (Thomas Stearns)