find shortest path between source node and destination node?
显示 更早的评论
hi , i have 5 nodes first one i want to be start and last one which 5 i want to be last node and i want find shortest path between fisrt and last nodes how i can i do this plz somebody help me
回答（2 个）
Ken Atwell
2015-5-19
0 个投票
Sounds like you're after a so-called breadth-first search (that search "wide" before "deep"). Google search "matlab breadth first search" and you will find several promising leads.
2 个评论
Walter Roberson
2015-5-19
When I read the question, I do not see that the search order is given, just that the shortest path is to be found.
Ken Atwell
2015-5-20
Delving into a graph in breadth first order will get you the shortest plan from the original point to another.
Walter Roberson
2015-5-19
0 个投票
Methods using image processing: http://blogs.mathworks.com/steve/2011/11/01/exploring-shortest-paths-part-1/
类别
在 帮助中心 和 File Exchange 中查找有关 Dijkstra algorithm 的更多信息
2015-5-20
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
