Finding shortest path on random node distributed.

1 次查看(过去 30 天)
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.

采纳的回答

Walter Roberson
Walter Roberson 2018-8-11
[~, 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 个)

类别

Help CenterFile Exchange 中查找有关 Graph and Network Algorithms 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by