A salesperson will sell products to several cities. The distance or distance between the known cities will be chosen. I will choose a route that starts from the station, passes through every city, and finally returns to the resident site, so that the total distance or road cost is the smallest. (backtracking)

Filename	Size	Update
经剪枝后的解空间树 截图.png	37332	2017-06-12
旅行售货员问题（回溯法）.cpp	2527	2017-06-12

• 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．