1. What is TSP issue?
The Traveling Salesman Problem (TSP for short) is a classic difficult problem in combinatorial optimization problems. Simply put, given a list of cities and the distance between each two cities, it is required to find the shortest path starting from a certain city and returning to this city, passing through all other cities and visiting each city only once. This is an NP-hard problem, which means we cannot find a definite optimal solution in polynomial time (when the problem size is large).
2. Introduction to Kotlin
Kotlin is a modern statically typed programming language designed to overcome some of the limitations of Java and add some features of modern programming. It is fully compatible with Java and can be used in Android development, server-side development and many other fields.
3. Data representation in Kotlin
To solve the TSP problem, first we need to represent our city and distance. With this in mind, we can do this using data classes in Kotlin.
data class City(val name: String, val x: Double<