Description:   There are a salesman, I want to n (n < = 10) cities to promote their products. To save travel costs, before his departure to identify the travel expenses between any two cities, want to find a travel route through each city only once, and make travel costs to a minimum. This problem is known cities n, n* n and expression of matrix between any two cities costs. Find the shortest path to their costs