Carrieukie/Traveling-Salesman-Problem-TSP

Given a list of cities and the distances between each pair of cities, find the shortest possible route that visits each city exactly once and returns to the original city.

Kotlin