A branch and bound solution to the travelling salesman problem.  First takes in the number of nodes follwed by a series of coordinates.  Included is an example input file.  Will output first the total distance of the path then the path itself.