Travelling Salesman Problem (TSP) is a very common problem used everyday in our life. The problem is basically travelling to all the vertices at once starting from a single source, and return back to the source using the shortest possible routes. For...
