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

1 回表示 (過去 30 日間)
zhou kun
zhou kun 2013 年 10 月 16 日
回答済み: Image Analyst 2013 年 12 月 27 日
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?

カテゴリ

Help Center および File Exchange で Nearest Neighbors についてさらに検索

タグ

Community Treasure Hunt

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

Start Hunting!

Translated by