Before we go after the full-blown TSP, let's look at a related simpler problem.
Given a graph G=(V,E), a Hamiltonian circuit (vertex tour) is a non-repeating, all-inclusive sequence of nodes in the graph that form a path.
The problem HAM is the decision problem: Does G have a Hamiltonian circuit?
Is HAM in NP?
