Shortest path that passes through certain nodes

Question

0 个投票

I have 13 points on a map, the distance from the original point to every other points, and the distance between all points are known. I need to find the shortest path that passes through all 13 points and returning to the original point. Please help! Thank you.

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

Walter Roberson 2015-11-16

Does the path only need to pass through all 13 points, or does it need to pass through each of the points exactly once ?

If it needs to pass through each point exactly once and return to the original, then this is known as a Hamiltonian Path, rather than as The Traveling Salesman Problem.

请先登录，再进行评论。

请先登录，再回答此问题。

Follow Question