algorithm to return all possible connections between two specific buses/nodes

조회 수: 12(최근 30일)
Talaria
Talaria 2011년 7월 10일
We begin by having a matrix showing direct connections between different nodes, for example for five buses: [0 1 0 1 0;1 0 1 1 0;0 1 0 0 1; 1 1 0 0 1; 0 0 1 1 0]
so how do i implement an algorithm to provide from the above and chosen inputs: e.g. connections between: node-1 and node-4, the possible connections would be, i.e.:
1 1-4 2 1-2&2-4 4 1-2&2-3&3-5&5-4
i have tried alot but can't seem to find a solution, based on my limited matlab and programming experience. please help!

채택된 답변

Walter Roberson
Walter Roberson 2011년 7월 12일
This is the all simple paths problem. For some algorithms, see here
  댓글 수: 5
Walter Roberson
Walter Roberson 2011년 7월 24일
See also
http://en.wikipedia.org/wiki/Depth-first_search
http://en.wikipedia.org/wiki/Breadth-first_search
http://www.mathworks.com/help/toolbox/bioinfo/ref/graphtraverse.html

댓글을 달려면 로그인하십시오.

추가 답변(0개)

Community Treasure Hunt

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

Start Hunting!

Translated by