Finding shortest path on random node distributed.

Question

Asyran Abdullah 2018-8-11

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/414458-finding-shortest-path-on-random-node-distributed

回答： Walter Roberson 2018-8-11

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 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Walter Roberson 2018-8-11

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/414458-finding-shortest-path-on-random-node-distributed#answer_332389

在 MATLAB Online 中打开

[~, 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.