E3658 D9138 C2735 B4716 A 4293 SolutionThis problem is a fam

Solution

This problem is a famous NP hard problem. There is no polynomial time know solution for this problem.

From the naive method, Consider city A as the starting and ending point and then find the minimum distance cycle.

The solution is: A-C-D-B-E-A, And the cycle weight is: 2+3+1+6+3.