the shortest route to visite all the nodes from the starting node to the destination matlab

조회 수: 1 (최근 30일)
Now i am meeting a problem how to find the shortest route to visit all the nodes in 2d plane from a predetermined node as the starting node to the destination.
now i have the distance matrix of these nodes. this case is very different from the case of Dijkstra_search , A star algorithm and tsp problem. because the algorithm must find the shortest to visit all the nodes from the starting node to the destination node.
thank you for your help

답변 (1개)

Image Analyst
Image Analyst 2013년 12월 27일
Why do you say it is different than the traveling salesman problem?

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by