all simple paths problem

1 vue (au cours des 30 derniers jours)
Talaria
Talaria le 23 Juil 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 commentaire
Walter Roberson
Walter Roberson le 24 Juil 2011
Duplicate is at http://www.mathworks.com/matlabcentral/answers/11285-algorithm-to-return-all-possible-connections-between-two-specific-buses-nodes

Connectez-vous pour commenter.

Connectez-vous pour répondre à cette question.

Réponse acceptée

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

Connectez-vous pour commenter.

Plus de réponses (0)

Catégories

En savoir plus sur Audio and Video Data dans Help Center et File Exchange

Tags

Community Treasure Hunt

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

Start Hunting!

Translated by