A similar to the TSP problem
Is there are many points on a plane, from a starting point, through all the points, for distance and the shortest, but in the end do not need to return to the starting point (no need to loop in the TSP problem), could you tell me how to solve this