TSP class working to solve the Traveling Salesman Problem. Initial guess of a ath can be found either by a random aproach or by a greedy heuristic (nearest neighbors).