maybe go back to your reference book and see how the traveling salesman problem that is NP-complete is defined.

while at that, look at the definition of NP-complete: problems that (apparently) cannot be solved in polynomial time, but whose solutions can be verified in polynomial time

CC: @home@mastodon.social