Following the symetric TSP complexity question, it can be calculated as follows:
For Cities: A, B, C, D, E:
The path EABCDE is equal to the path: EDCBAE because of its symetry: (EAB|CDE) --> = <-- (EDC|BAE).
Then, the obteined number 24 paths should be devided by 2 to eliminate the half paths and then, the remainder number is 12 = (5-1)! /2 = (n-1)! /2 where: n is the number of cities.
For Cities: A, B, C, D, E:
The path EABCDE is equal to the path: EDCBAE because of its symetry: (EAB|CDE) --> = <-- (EDC|BAE).
Then, the obteined number 24 paths should be devided by 2 to eliminate the half paths and then, the remainder number is 12 = (5-1)! /2 = (n-1)! /2 where: n is the number of cities.
