Find all paths in a graph with distance, previous nodes

조회 수: 3 (최근 30일)
sastra university
sastra university 2022년 9월 3일
댓글: sastra university 2022년 9월 7일
Dear all,
I am working on traffic assignment problems. I have a distance matrix.
for example,
A=[0 inf inf
15 0 20
10 inf 0];
the distance from node 1 to node 2 is 15, node 3 to node 2 is 20 and node 1 to node 3 is 10.
Using Dijkstra algorithm, I can find shortest path, previous nodes.
But I need to determine the all possible paths from one source node to all other nodes.
Please help me matlab code to arrive the distances, previous nodes.
Thanks in advance.
Muthukannan

답변 (1개)

Bruno Luong
Bruno Luong 2022년 9월 3일
It is not clear what you want to achieve but you might take a look at this function

카테고리

Help CenterFile Exchange에서 Dijkstra algorithm에 대해 자세히 알아보기

제품


릴리스

R2022a

Community Treasure Hunt

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

Start Hunting!

Translated by