Hello there,

You can use of this sources

You can choose the Dijkstra Algorithm for that ...

Thank you for your answer,

But how to implement Dijkastra Algorithm in MATLAB?

you can use Dijkstra as well as shortest path first algorithm....

The shortest path in a grid consists into adding horizontal edges or vertical edges to fill the gap between the two pairs of coordinates. The lenth of the shortest path is the sum of the absolute values of the coordinates. You don't need the Dijkstra machinery. You can arbitrarily alternate horizontal and vertical edges, or first choose to fill first the horizontal gap and then the vertical gap, or vice versa.

You may use the following function:

http://www.mathworks.com/matlabcentral/fileexchange/12850-dijkstra-s-shortest-path-algorithm

Its so simple! Just search Dijkstra in matlab help!!!

simply use this line:

>>graphshortestpath(G,S,T,'Method','Dijkstra')

G: a matrix that represent the graph

S: start Node

T: Target Node

You can use the Dijkstra algorithm, look at an example:

https://gist.github.com/jcchurch/930280

There is built-in function graphshortestpath in Matlab. Use it.

Hello there,

You can use of this sources