kieran-grant/ShortestPath
A version of the travelling salesman problem. Takes a list of cities and their coordinates and determines, using the closest neighbour method, both the shortest route and the optimum staring position.
Python
A version of the travelling salesman problem. Takes a list of cities and their coordinates and determines, using the closest neighbour method, both the shortest route and the optimum staring position.
Python