find shortest path between source node and destination node?
2 views (last 30 days)
Show older comments
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
0 Comments
Answers (2)
Ken Atwell
on 19 May 2015
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 Comments
Walter Roberson
on 19 May 2015
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
on 20 May 2015
Delving into a graph in breadth first order will get you the shortest plan from the original point to another.
Walter Roberson
on 19 May 2015
Methods using image processing: http://blogs.mathworks.com/steve/2011/11/01/exploring-shortest-paths-part-1/
0 Comments
See Also
Categories
Find more on Dijkstra algorithm in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!