Much attention has be drawn by the Travelling salesman problem lately as it is one of the problem in mathematics and computer science which although is easy to understand but very difficult to solve. In this paper, a preliminary study is undertaken to construct a minimum spanning tree algorithm to approximately solve the TSP. An implementation of the… (More)