The shortest path is found starting from City 1 and returning to it while visiting other cities only once.

The coordinates of the cities : City-1(0 ,0), City-2(2,6), City-3(8,4), City-4(7,2), City-5(1,6), City-6(4,9), City-7(3,2)

You need to find the tour in terms of the sequence of the cities visited and the traveling distance.

*There is one more condition that City-3 must be visited before City-7.

The code should be in C and I hope for it to be easy to change to assembly language!

This was all the info that I got! It is a TSP problem.