Home Work 10

Implement nearest neighbor local serach algorithm for finding a Traveling salesman problem. At each step, from a vertex/city chose the closest/nearest unvisited vertex. Once you visit a vertex mark it visit. When you visit the last vertex/city, please complete the route by visiting the starting vertex. The cost of the route is the sum of the cost of all edges.

1. Repeat this with every starting vertex.
2. Test with the following two test test data. 48 city and Dantsig's 42 city

Submit a copy of your programs to WebCT and a readme file (containing

1. a short instruction on how to compile and use your program,and comment your code nicely).
2. sample outputput.(the costs and the rout routes for the two examples)