问题陈述：有一推销员，欲到n(n<=10)个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。-Problem Statement: a salesman, n (n < = 10) cities want to sell products. Before departure in order to save travel expenses, he find out the cost of travel between any two cities, want to find a travel route, after each city only once, and the travel expenses to a minimum.