all simple paths problem

2 Ansichten (letzte 30 Tage)
Talaria
Talaria am 23 Jul. 2011
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
  1 Kommentar
Walter Roberson
Walter Roberson am 24 Jul. 2011
Duplicate is at http://www.mathworks.com/matlabcentral/answers/11285-algorithm-to-return-all-possible-connections-between-two-specific-buses-nodes

Melden Sie sich an, um zu kommentieren.

Melden Sie sich an, um diese Frage zu beantworten.

Akzeptierte Antwort

Andrew Newell
Andrew Newell am 24 Jul. 2011
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.
  2 Kommentare
Talaria
Talaria am 24 Jul. 2011
what is breadth-first search and what is depth first search? i am not familiar with these terms? thanks!
Andrew Newell
Andrew Newell am 24 Jul. 2011
If you click on the link for breadth-first search in the NIST link, you'll know as much as me.

Melden Sie sich an, um zu kommentieren.

Weitere Antworten (0)

Kategorien

Mehr zu Audio and Video Data finden Sie in Help Center und File Exchange

Tags

Community Treasure Hunt

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

Start Hunting!

Translated by