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 in combinatorial optimization, important in operations research and theoretical computer science. (Quoted from "The "travelling salesman problem" asks the follo
阅读背景：
PAT甲级——A1150 TravellingSalesmanProblem【25】
来源：互联网
分享到：
