GitHub repository: LHAWLEY/traveling_salesman
Primary language: Ruby
Created: 2016-04-13T23:27:51Z
Description: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?