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

Answer 1

[Ken Atwell]

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.

[Walter Roberson]

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]

Delving into a graph in breadth first order will get you the shortest plan from the original point to another.

Answer 2

[Walter Roberson]

Bioinfomatics toolbox: http://www.mathworks.com/help/bioinfo/ref/graphshortestpath.html

Methods using image processing: http://blogs.mathworks.com/steve/2011/11/01/exploring-shortest-paths-part-1/

Dijkstra's Algorithm File Exchange Contribution