Finding shortest path on random node distributed.
3 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Asyran Abdullah
le 11 Août 2018
Réponse apportée : Walter Roberson
le 11 Août 2018
Hi all, I have a problem to finding a shortest path in a random node distributed. Here is my code:
% code
rand('seed',123456);
x=randi([10, 100]);
y=randi([10, 100]);
G = digraph(max(randi([-60 10], 10), 0));
plot(G,'EdgeLabel',G.Edges.Weight)
title('Finding Shortest Path on Random Node');
I try to use a function of "shortestpath" but unfortunately it need a static node for source & destination. Hope other user can help me.
Thanks.
0 commentaires
Réponse acceptée
Walter Roberson
le 11 Août 2018
[~, idx] = min(G.Edges.Weight);
shortest_path = G.Edges.EndNodes(idx,:);
Because you do not have a static node for source and destination, we are free to say that the shortest path is the single edge of minimum weight -- you have not, for example, said that the shortest path must be (say) length 3.
0 commentaires
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur Construction 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!