Difference between travelling salesman problem and hamiltonian cycle in tabular form
Answers
Answered by
3
One difference is that the traveling salesman problem is a Hamiltonian cycle. Another difference is that the traveling salesman problem is used to find a path that contains permutationof every node in a graph, and it is a NP-complete problem and the shortest path is known polynomial-time.
Similar questions