Travelling Salesman Problem (TSP): Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point

• Note the difference between Hamiltonian Cycle and TSP.

• The Hamiltonian cycle problem is …