An implementation of the Ant Colony algorithm for finding the minimum tour length in the Travelling Salesman Problem
Input file is formatted:
city x-coord y-coord
city2 x-coord y-coord
Output is:
Distance
first city visited
second city Visited
third city Visited
.
.
.
last city visited
Assumes that every city is connected to every other city.