There a salesman, I want to n (n < = 10) cities to promote their products. To save travel costs, identify him before departure arbitrary travel expenses between the two cities, want to find a travel route through each city only once, and made travel costs the least.

EST2.CPP

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．