PAT-A1150 Travelling Salesman Problem (25分)
题目描述:
The “travelling salesman problem” asks the following question: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?” It is an NP-hard problem
原创
2020-05-11 13:30:59 ·
152 阅读 ·
0 评论