how to find all possible paths between the two selected nodes.And how to label these nodes from given coordinate points.

2 次查看（过去 30 天）
Sneha Kolapalli
Sneha Kolapalli 2017-4-5
回答： Sid Jhaveri 2017-4-10
The nodes are located at 10 different (x,y)coordinates z =
8 1
4 2
7 3
1 2
8 2
4 3
7 0
1 3
8 4
4 2
source=(1,2) and target=(8,4)

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

回答（1 个）

Sid Jhaveri
Sid Jhaveri 2017-4-10
You might want to refer to the following links:
1) https://www.mathworks.com/matlabcentral/answers/171277-how-can-i-get-all-paths-between-two-nodes
2) http://blogs.mathworks.com/steve/2011/11/01/exploring-shortest-paths-part-1/
I believe you can also use Yen's K-Shortest Path algorithm. I would recommend searching the MATLAB file exchange for any implementation of this function. I was able to find the following to implementation of this algorithm:
1) https://www.mathworks.com/matlabcentral/fileexchange/32513-k-shortest-path-yen-s-algorithm
2) https://www.mathworks.com/matlabcentral/fileexchange/35397-k-shortest-paths-in-a-graph-represented-by-a-sparse-matrix--yen-s-algorithm-
Please note that you would have to store the information regarding the edges of the given graph somewhere (For example a matrix). Without the information about edges, it might not be possible to achieve this. Thus, I would recommend creating and storing information regarding the edges of this graph in a matrix before trying the above given solutions/ideas.

类别

在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by