Hamiltonian Path Problem

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:

    But the path of the righteous is like the light of dawn, which shines brighter and brighter until full day. The way of the wicked is like deep darkness; they do not know what they stumble over.
    Bible: Hebrew, Proverbs 4:18-19.

    Our political problem now is “Can we, as a nation, continue together permanentlyforever—half slave, and half free?” The problem is too mighty for me. May God, in his mercy, superintend the solution.
    Abraham Lincoln (1809–1865)