Dijkstra's algorithm \ shortest paths

Amy
2015 6 18
2 个回答
更新时间：2015 6 22
4 次查看（30 天）

0 个投票

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

4 个评论
显示 2更早的评论 隐藏 2更早的评论

Amy
Amy 2015-6-19
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
Image Analyst 2015-6-19
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
Amy 2015-6-22
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.兇闢

请先登录，再进行评论。

请先登录，再回答此问题。

类别

在 帮助中心 和 File Exchange 中查找有关 Dijkstra algorithm 的更多信息

标签

提问:

Amy
Amy
2015-6-18

评论：

Amy
Amy
2015-6-22

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by