How to find All possible paths from one node to another node......

ld=[1 2 2;
    1 3 2;
    1 4 3;
    2 3 3;
    3 4 2;
    4 5 4;
    4 6 4;
    5 6 3];

first two column represent edge (node connectivity) of graph and third column represent distance between that line. For example: I want to know all paths from 3 to 4.

My answer will be :

[3 4]

[3 1 4]

[3 2 1 4]

Please help me to solve this. I already use Dijkstra algorithm but Dijkstra algorithm is in xy plane or xyz plane, which is not like my problem.

[Walter Roberson]

In a duplicate copy of the question, Roger Stafford commented,

The Dijkstra algorithm is concerned with finding the shortest path between a pair of nodes, or the shortest between a given source node and all the other nodes, and that would involve your column three. However, your request is different - you want all possible paths between a pair of nodes - so the Dijkstra algorithm would be of no use to you in any case, nor is there any use for your column three.

If you have a graph with 246 nodes, the chances are that you would have an astronomically large number of possible paths between nodes. What would you do with such a list after you have obtained it?

Answer 1

[Walter Roberson]

http://www.mathworks.com/matlabcentral/answers/171277-how-can-i-get-all-paths-between-two-nodes#answer_165813

[raj singh]

Hello sir,

your given link has no code for m problem, if you understand that prob then please solve my problem.

[Walter Roberson]

https://github.com/kakearney/pathbetweennodes-pkg

[raj singh]

There is limitations for nodes. Is there any code in which no limitations. I have 118 nodes and 246 node systems. Your given link work only for ~50 nodes.

[Walter Roberson]

That code has no limit on nodes. The author tested it up to about 50 nodes, but there is no limit in the code.

[raj singh]

when i try for 118 nodes, its hanging.........

[Walter Roberson]

You might not have enough memory to find all of the paths, or it might simply be very busy calculating the paths.

You can also look at http://www.mathworks.com/matlabcentral/fileexchange/27438-find-all-the-possible-paths-between-a-start-and-an-end-node-of-a-graph but it warns that it bogs down when you get to about 20 nodes.

You could also look at http://stackoverflow.com/questions/28824640/find-all-possible-paths-in-a-graph-using-matlab-brute-force-search

[ankanna]

node = 3; ri=0.9;

L=(node*(node-1))/2;

configuration = dec2bin(0:(2^L-1))-'0';

alfak=configuration;

source node=1; destination node=3;

m = Limit on intermediate node;

2TR(alfak) == ri^m;

how to calculate two terminal reliability.

alfak Path 2TR(alfak)

1 r1r3 0.81

2 r1r3 0.81

3 r1r2r3 0.73

4 r1r3 0.81

5 None 0.00

6 r1r3 0.81

7 None 0.00

8 None 0.00

please help me to generate above and i want that 2terminal reliability at output.