When the traveling salesman problem (Hamiltonian circuit) is applied to six cities, how many distinct circuits are possible?
A) 120
B) 60
C) 24
D) 12

Name: When the traveling salesman problem (Hamiltonian circuit) is applied to six cities, how many distinct circuits are possible? A) 120 B) 60 C) 24 D) 12
Brand: Quizplus
Rating: 4.8 (44 reviews)

Question

Quizplus · Accepted Answer

For a Hamiltonian circuit in a complete graph with n vertices, the number of distinct circuits is (n-1)!/2. For six cities, it is (6-1)!/2 = 60.

When the Traveling Salesman Problem (Hamiltonian Circuit) Is Applied to Six