find shortest path between source node and destination node?

14 次查看（过去 30 天）

显示更早的评论

noor ali 2015-5-18

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/217441-find-shortest-path-between-source-node-and-destination-node

评论： Ken Atwell 2015-5-20

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 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

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

回答（2 个）

Ken Atwell 2015-5-19

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/217441-find-shortest-path-between-source-node-and-destination-node#answer_179579

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 个评论
显示无隐藏无

Walter Roberson 2015-5-19

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 2015-5-20

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

请先登录，再进行评论。

Walter Roberson 2015-5-19

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/217441-find-shortest-path-between-source-node-and-destination-node#answer_179587

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

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

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

类别

MATLAB Mathematics Graph and Network Algorithms Modify Nodes and Edges Dijkstra algorithm

在 Help Center 和 File Exchange 中查找有关 Dijkstra algorithm 的更多信息

标签

Community Treasure Hunt

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

Translated by