How to find Dijkstra shortest path for multiple source single destination problem?
4 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
I want to find Dijkstra shortest path form three different source nodes to single destination point and my input is netcost matrix.Please help me out to figure out this problem.
0 commentaires
Réponses (2)
Walter Roberson
le 3 Oct 2017
%create a graph for illustration
data = randi(15, 20, 2);
G = graph(data(:,1),data(:,2));
sources = [3, 8, 11];
dest = 14;
shortest_paths = shortestpathtree(G, sources, dest, 'outputform', 'cell');
shortest_paths will now be a cell array of paths.
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!