**Travelling Salesperson**

According to wikipedia, "The travelling salesperson problem asks the following question: 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?" I spent a considerable amount of time in finding the best solution to this problem. There are different algorithms that can be used to approach this problem. However, I was required to make use of three different algorithms (the brute-force, branch and bound, and greedy algorithm) with the aim of getting the quickest solution.