Return all ShortestPath explored nodes
2 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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
0 commentaires
Réponses (2)
Aparajith Raghuvir
le 7 Juil 2021
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 commentaires
Bruno Luong
le 7 Juil 2021
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
le 8 Juil 2021
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
le 7 Juil 2021
Modifié(e) : Bruno Luong
le 7 Juil 2021
This problem has been answered in this thread
0 commentaires
Voir également
Catégories
En savoir plus sur Dijkstra algorithm dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!