A = [ 1 2 1;1 3 1;1 4 1;2 5 2;3 5 3;4 5 4] ; For above matrix first i need out put like all possible path like 1-2-5 and its total weight (1+2 =3); path 1-3-5 and its total weight (1+3 = 4), Path 1-4-5 and its total weight (1+4 =5);

1 次查看（过去 30 天）

显示更早的评论

DHARMAN J 2018-7-30

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/412698-a-1-2-1-1-3-1-1-4-1-2-5-2-3-5-3-4-5-4-for-above-matrix-first-i-need-out-put-like-all-possibl

评论： Guillaume 2018-7-30

采纳的回答： Magdy Saleh

Finding Longest Path in Directed Acyclic Graph

2 个评论
显示无隐藏无

KALYAN ACHARJYA 2018-7-30

编辑：KALYAN ACHARJYA 2018-7-30

What are the path represents? Matrix element values?

DHARMAN J 2018-7-30

In each Row, First two element for connection between two nodes and third elements for its weight for that connection

请先登录，再进行评论。

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

采纳的回答

Magdy Saleh 2018-7-30

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/412698-a-1-2-1-1-3-1-1-4-1-2-5-2-3-5-3-4-5-4-for-above-matrix-first-i-need-out-put-like-all-possibl#answer_330903

在 MATLAB Online 中打开

You can try this:

A = [ 1 2 1;1 3 1;1 4 1;2 5 2;3 5 3;4 5 4];
cntr = 1;
path = [];
for i = 1:length(A)
    path(i).startNode = A(i, 1);
    path(i).path = [A(i, 2)];
    path(i).weight = A(i, 3);
end
for i = 1:length(A)
    for j = 1:length(A)
        if(path(j).path(end) == A(i, 1))
            path(j).path = [path(j).path,  A(i, 2)];
            path(j).weight = path(j).weight +  A(i, 2);
        end
    end
end

But this assumes that your paths are at most of length two. Otherwise you might want to consider a recursive approach.

11 个评论
显示 9更早的评论隐藏 9更早的评论

DHARMAN J 2018-7-30

Hi sir, Thanks for reply. I couldn't implement such algorithms. S only posted here

Guillaume 2018-7-30

I suggest you make a start at implementing and when you have a specific problem with it, come back and ask for help, showing what you have come up with so far.

请先登录，再进行评论。