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:
“So-called “austerity,” the stoic injunction, is the path towards universal destruction. It is the old, the fatal, competitive path. “Pull in your belt” is a slogan closely related to “gird up your loins,” or the guns-butter metaphor.”
—Wyndham Lewis (1882–1957)
“To make a good salad is to be a brilliant diplomatist—the problem is entirely the same in both cases. To know exactly how much oil one must put with one’s vinegar.”
—Oscar Wilde (1854–1900)