GitHub repository: masopie/traveling_salesman
Primary language: Ruby
Created: 2016-04-22T13:16:57Z
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?