How to find Dijkstra shortest path for multiple source single destination problem?
조회 수: 4 (최근 30일)
이전 댓글 표시
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개)
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.
댓글 수: 0
참고 항목
카테고리
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!