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

Question

raj singh 2016-5-30

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/286462-how-to-find-all-possible-paths-from-one-node-to-another-node

评论： ankanna 2021-4-19

ld=[1 2 2;
3 2;
4 3;
3 3;
4 2;
5 4;
6 4;
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 个评论
显示 -1更早的评论隐藏 -1更早的评论

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?

请先登录，再进行评论。

请先登录，再回答此问题。