B"H
In things like Google maps one can enter a list of locations to go to in order and it gives you the shortest path to take
What I would like to do is take in a list of locations, with no particular order (except for one starting point) and find the shortest for route that goes through all points
I was thinking of starting at the first location, and finding the distance from it to all other points, then returning the shortest for the first place to go, and repeat the process, but I'm not sure if that's logically correct