TSP number of options that must be calculated

[mathwmre]

I am trying to introduce students to the Traveling Salesman Problem.

After doing some research, I found an example that indicated for 5 different stops, we must calculate 60 different options.

I am trying to figure out how they got to this calculation because 5! would give us 120 different options for a standard permutation.

Any clarity would help so that I could more effectively communicate the problem to students.

Thanks!