Create a MIPS code for travelling salesman
$10-30 USD
Paid on delivery
In this project, a shortest tour is found starting from City-1 and finally returning to it, while visiting other cities only once. The coordinates of the cities are
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.
As the output, present the path and the distance traveled.
The program should be coded using MIPS assembly.
It should be the shortest tour.
Project ID: #16959374
About the project
3 freelancers are bidding on average $125 for this job
I teached MIPS assembly language using SPIM at university for four years, so I can definitely solve your problem.