Originally Posted by

**grumpy** Given your problem description, there is no "the path". For any given set of points, there are many possible paths through them.

If your goal is to minimise the travel distance, then you are almost certainly talking about some variation of the travelling salesman problem, which is about finding the shortest path through all the points, and returning to the starting point.

If there are some sets of points with no direct path between them, then you will probably need to identify subsets of points, solve the travelling salesman problem for each subset, and then string the paths together.