How can i get all paths between two nodes ??

Question

shaifali shakya 2015-1-23

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/171277-how-can-i-get-all-paths-between-two-nodes

评论： Image Analyst 2020-6-21

采纳的回答： Kelly Kearney

How can i get all paths between two nodes

2 个评论
显示无隐藏无

Geoff Hayes 2015-1-24

Shaifali - you will need to provide some more details. Do you have a matrix representing all paths between a set of nodes and you wish to find all paths between just two of them?

shaifali shakya 2015-1-24

yes i have a matrix representing all paths between a set of nodes and i wish to find all paths between source and destination.

请先登录，再进行评论。

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

Answer 1

Kelly Kearney 2015-1-24

8
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/171277-how-can-i-get-all-paths-between-two-nodes#answer_165813

If you're looking for the shortest paths, there are a few FEX entries that implement algorithms for this, including both depth-first and breadth-first searches. I use matlab_bgl, which includes several shortest path algorithms.

However, if you're really looking for all paths between two nodes, I found that algorithms for that are more scarce. I wrote pathbetweennodes.m to do just that... I wrote it for fairly small graphs (~50 nodes or fewer), so I'm not sure how efficient it might be for larger graphs, but it has worked well for my purposes.

2 个评论
显示无隐藏无

Kelly Kearney 2016-9-1

An update on my answer, since this is now out of date...

I've moved this function to GitHub: https://github.com/kakearney/pathbetweennodes-pkg.

Also, Matlab 2015b and above now includes some native shortest path methods for graph objects, so you don't need matlab_bgl.

Pham Minh Cong 2020-3-9

Great work !

Thank you for your contribution.

I am new to this subject, do you have a name for your algorithms ?

请先登录，再进行评论。

Answer 2

Emad NB 2018-12-14

2
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/171277-how-can-i-get-all-paths-between-two-nodes#answer_352365

在 MATLAB Online 中打开

You can use my function below. I use weight factor as a signal to find different pathes:

function pth=pathof(graph,startn,endn)
stop=0;
n=0;
while stop~=1
    n=n+1;
    Temp=shortestpath(graph,startn,endn);
    eidx=findedge(graph,Temp(1:end-1),Temp(2:end));
    if n~=1
        if length(Temp)==length(pth{n-1,1})
            if Temp==pth{n-1,1}
                stop=1;
            else
                pth{n,1}=Temp;
                graph.Edges.Weight(eidx)=100;
            end
        else
            pth{n,1}=Temp;
            graph.Edges.Weight(eidx)=100;
        end
    else
        pth{n,1}=Temp;
        graph.Edges.Weight(eidx)=100;
    end
    clear Temp eidx;
end

2 个评论
显示无隐藏无

mujahid razman 2020-6-21

Simulate any shortest path algorithm between point A to point B if the map is known. Consider the map consists of free space and any configuration of finite obstacles. The result can be shown in 2-D graph where 0 means obstacle, 1 means free space and 2 means trajectory followed. For instance you can simulate A* algorithm in Matlab.

how to solve please help