Solve the traveling salesman problem for tins graph by the total weight of all Hamilton circuits and determining a circuit with minimum total weight. Solution We pick any point to start at, and select all possible combinations of the other 3 points. Let\'s start with A. A-B-C-D-A = 3 + 6 + 7 + 2 = 18 A-B-D-C-A = 3 + 4 + 7 + 5 = 19 A- C-B-D-A = 5 + 6 + 4 + 2 = 17 A-C-D-B-A = 5 + 7 + 4 + 3 = 19 A-D-B-C-A = 2 + 4 + 6 + 5 = 17 A-D-C-B-A = 2 + 7 + 6 + 3 = 18 There are two paths with the minimum weight of 17. Thus, this is the minimum weight..