加入
The complexity of the longest tour through points in the plane
Determine whether finding the longest tour through n points in the plane, with Euclidean distances, is NP-hard or solvable in polynomial time.
Issue
疑问、子问题和求助。把大问题拆成子 Issue；从任何一个 Issue 都能开出路线。
没有开放的 Issue
Issue 用来放疑问、子问题和求助。