Find all paths in a graph with distance, previous nodes

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

Answer 1

[Bruno Luong]

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

[sastra university]

Thank you for the response.