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

Answer 1

[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

[Steven Lord]

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]

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]

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]

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.

Answer 2

[Bruno Luong]

This problem has been answered in this thread

https://www.mathworks.com/matlabcentral/answers/494497-how-can-i-get-all-the-existing-shortest-paths-between-two-single-nodes-for-graph?s_tid=srchtitle