Hamiltonian path problem
Determine whether a tour that visits each location once and returns to its starting point exists. This is an NP-Complete problem.
Search
Determine whether a tour that visits each location once and returns to its starting point exists. This is an NP-Complete problem.