How to find Dijkstra shortest path for multiple source single destination problem?

Question

indu 2017-10-3

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/359425-how-to-find-dijkstra-shortest-path-for-multiple-source-single-destination-problem

回答： Walter Roberson 2017-10-3

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

请先登录，再进行评论。

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

Answer 1

KSSV 2017-10-3

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/359425-how-to-find-dijkstra-shortest-path-for-multiple-source-single-destination-problem#answer_284060

Search in file exchange:

https://in.mathworks.com/matlabcentral/fileexchange/20025-dijkstra-s-minimum-cost-path-algorithm

https://in.mathworks.com/matlabcentral/fileexchange/12850-dijkstra-s-shortest-path-algorithm

https://in.mathworks.com/matlabcentral/fileexchange/14661-dijkstra-very-simple

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

Answer 2

Walter Roberson 2017-10-3

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/359425-how-to-find-dijkstra-shortest-path-for-multiple-source-single-destination-problem#answer_284079

在 MATLAB Online 中打开

%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');