MATLAB Answers

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

6 views (last 30 days)
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!

Accepted Answer

Walter Roberson
Walter Roberson on 12 Jul 2011
This is the all simple paths problem. For some algorithms, see here
  5 Comments
Walter Roberson
Walter Roberson on 24 Jul 2011
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

Sign in to comment.

More Answers (0)

Community Treasure Hunt

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

Start Hunting!