Traveling Salesman Algorithm
Good for finding the shortest path
Dylan J. Raub
Good for finding the shortest path. Takes ' x!/10000.0 ' seconds (x being the number of points if they are all connected to each other). Can get devistatingly slooooooow... I will evectually have a better version.
Traveling Salesman Algorithm 1.0 — 19 Sep, 2008