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

14 ビュー (過去 30 日間)
raj singh
raj singh 2016 年 5 月 30 日
コメント済み: ankanna 2021 年 4 月 19 日
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.
  1 件のコメント
Walter Roberson
Walter Roberson 2016 年 5 月 31 日
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?

サインインしてコメントする。

回答 (1 件)

Walter Roberson
Walter Roberson 2016 年 5 月 30 日
  7 件のコメント
Walter Roberson
Walter Roberson 2016 年 5 月 31 日
You might not have enough memory to find all of the paths, or it might simply be very busy calculating the paths.
ankanna
ankanna 2021 年 4 月 19 日
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.

サインインしてコメントする。

カテゴリ

Help Center および File ExchangeDijkstra algorithm についてさらに検索

Community Treasure Hunt

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

Start Hunting!

Translated by