Coordinate Connecting Input:
Ten unique integer coordinates, between (0,0) and (100,100).
Output:
The coordinates arranged in the order/an order such that a path drawn between the coordinates in that order is the shortest path possible.
This is code golf so the shortest code wins!
Husk, 12 11 bytes
Edit: -1 byte thanks to a tip from Leo
◄oṁ√Ẋδṁo□-P

Try it online (with only 8 points to avoid timing-out...)
How?
          P  # from all permutations of the input
◄o           # get the one that minimizes the result of
  ṁ√         # sum of all the square roots of
    Ẋ        # applying to all adjacent sets of coordinates
     δṁo     # sum of all the
        □-   # squares of the differences