Return all ShortestPath explored nodes
显示 更早的评论
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
2021-7-7
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 个评论
Steven Lord
2021-7-7
If you are using the shortestpath function included in MATLAB, please do not modify that source code!
Why do you need the information about the steps the shortest path function took internally in the course of its calculations?
Aparajith Raghuvir
2021-7-7
The user Saharsh Bansal wanted to know the internal steps that the algorithm used. In case I was not clear, I do not suggest changing the source code, but using the source code as a reference to build your own custom function that outputs all explored nodes
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
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
2021-7-7
编辑：Bruno Luong
2021-7-7
0 个投票
This problem has been answered in this thread
类别
在 帮助中心 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
2021-7-3
2021-7-8
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
