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

8 次查看（过去 30 天）
indu
indu 2017-10-3
回答： 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.

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

回答（2 个）

KSSV
KSSV 2017-10-3
Walter Roberson
Walter Roberson 2017-10-3
%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.

类别

在 Help Center 和 File Exchange 中查找有关 Dijkstra algorithm 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by