Dijkstra's algorithm \ shortest paths

https://en.wikipedia.org/?title=Dijkstra%27s_algorithm#/media/File:Dijkstras_progress_animation.gif

----how to do this? ----thanks alot :D ----this picture is taken from wiki:https://en.wikipedia.org/?title=Dijkstra%27s_algorithm

[Walter Roberson]

[Amy]

Additional information: There is the map: (Composite by 0011...) the black part is obstacle.

and I want to start form one point(ex: index (8,2))and find the shortest path to the end point. Also, count the distance. For one point ,it has eight direction to go. such as up,down,left,right,and the distance=1.At the other direction, the distance=square root(2). the result looks like the picture below .I draw it using Paint,so it has wrong scale ><.

[Image Analyst]

Evidently you didn't see my answer, or if you did, you didn't look as far as part 5 in the blog

Looks pretty similar to what you're asking for. Did you actually even try Steve's code?

[Amy]

Thank you a lot. You guys answering efficiency is super. The concept in the steve's blog is very helpful. Then I feel that I really really need to buy the image tool box right now.兇闢

Answer 1

[Walter Roberson]

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

Answer 2

[Image Analyst]

If your graph is an image , see Steve's blog on shortest paths.