Hamiltonian Path Decision Problem
Input: Undirected Graph G =(V,E).
Output: Determine if there is a path in G that visits each node exactly once.
Decision problem: Yes or No answer.
This is a famous NP-complete problem.
NP-complete problems do not appear to have polynomial time algorithms.
NP-complete problems are hard to solve!