Travelling Salesman problem in c

Travelling Salesman problem is a classic problem, that is used to find out the minimum cost in which a salesman can visit all the given cities. The problem complexity wise is NP. But approximate solutions to the problem are possible. A greedy approach using Kruskal's algorithm or back tracking algorithm can be used to reach to the solution. To view code for TSP using back tracking Click Here.