all simple paths problem

1 visualización (últimos 30 días)
Talaria
Talaria el 23 de Jul. de 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 comentario
Walter Roberson
Walter Roberson el 24 de Jul. de 2011
Duplicate is at http://www.mathworks.com/matlabcentral/answers/11285-algorithm-to-return-all-possible-connections-between-two-specific-buses-nodes

Iniciar sesión para comentar.

Iniciar sesión para responder a esta pregunta.

Respuesta aceptada

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

Iniciar sesión para comentar.

Más respuestas (0)

Categorías

Más información sobre Mathematics en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

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

Start Hunting!

Translated by