Find all paths in a graph with distance, previous nodes

3 次查看（过去 30 天）
sastra university
评论： 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
https://uk.mathworks.com/help/matlab/ref/graph.allpaths.html

类别

在 Help Center 和 File 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