GitHub repository: Keurti/Travelling-Salesman-Problem
Primary language: Python
Created: 2017-05-17T10:24:07Z
Description: Given a list of indexed cities, the objective is to give the shortest path to visiting all cities once. The solution would be a list of indexes, giving the order in which we visit the cities.