清空筛选条件
清空筛选条件

Return all ShortestPath explored nodes

4 次查看（过去 30 天）
Saharsh Bansal
Saharsh Bansal 2021-7-3
评论： Aparajith Raghuvir 2021-7-8
Is there a way for me to get a list of all explored nodes in the function
shortestpath(G,s,t)
Or if there is a different way that I can get a list of all explored nodes in BFS and Dijkstra

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

回答（2 个）

Aparajith Raghuvir
I understand you need to get a list of all explored nodes in BFS and Djikstra's shortest path algorithms
You may run the following code
edit shortestpath
This would give you the source code of the shortestpath function that you may modify to extract the list of all explored nodes
  4 个评论
显示 2更早的评论
Bruno Luong
Bruno Luong 2021-7-7
Aparajith Raghuvir have you tried it? The shortestpath file is a wrapper, the algorithm (such as bfsShortestPaths) seems to run on non-m file.
Aparajith Raghuvir
Aparajith Raghuvir 2021-7-8
Oh, if that is the case then unfortunately you may need to code the algorithms yourself to get all nodes that were explored as part of it.

请先登录，再进行评论。

Bruno Luong
Bruno Luong 2021-7-7
编辑：Bruno Luong 2021-7-7

类别

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

标签

产品


版本

R2020a

Community Treasure Hunt

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

Start Hunting!

Translated by