The dynamic programming method of traveling salesman problem (TSP)

http://soj.sysu.edu.cn/show_problem.php?pid=1000&cid=1769

Sicily traveling salesman problem

There are n cities numbered 1 to N, asking for the shortest path length from city 1th, traversing all the cities and finally staying in the N city.

Input

First line integer t:t Group data (T<=20)

Each case reads an n (2 <= n <= 20) and then enters n rows, and the line I has two integers xi,yi represents the coordinates on the i city axis, and the distance of two cities is defined as Euclidean distance. Output

Each case outputs a floating-point number representing the shortest path. Rounding retains two decimal places.

140 01 00) 11 1

The dynamic programming method of traveling salesman problem (TSP)