all simple paths problem

2 visualizzazioni (ultimi 30 giorni)
Talaria
Talaria il 23 Lug 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 Commento
Walter Roberson
Walter Roberson il 24 Lug 2011
Duplicate is at http://www.mathworks.com/matlabcentral/answers/11285-algorithm-to-return-all-possible-connections-between-two-specific-buses-nodes

Accedi per commentare.

Accedi per rispondere a questa domanda.

Risposta accettata

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

Accedi per commentare.

Più risposte (0)

Categorie

Scopri di più su Graph and Network Algorithms in Help Center e File Exchange

Tag

Community Treasure Hunt

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

Start Hunting!

Translated by