all simple paths problem

is there a way or an algorithm in matlab to solve the all simple paths problem?

refer: http://xlinux.nist.gov/dads//HTML/allSimplePaths.html

http://stackoverflow.com/questions/58306/graph-algorithm-to-find-all-connections-between-two-arbitrary-vertices

[Walter Roberson]

Duplicate is at http://www.mathworks.com/matlabcentral/answers/11285-algorithm-to-return-all-possible-connections-between-two-specific-buses-nodes

Answer 1

[Andrew Newell]

The package gaimc implements the breadth-first search mentioned in your NIST link. This might be a starting point for you. The remainder of the algorithm description in the NIST link sounds like reasonably straightforward bookkeeping.

[Talaria]

what is breadth-first search and what is depth first search? i am not familiar with these terms? thanks!

[Andrew Newell]

If you click on the link for breadth-first search in the NIST link, you'll know as much as me.