MathGroup Archive 2007

[Date Index] [Thread Index] [Author Index]

Search the Archive

find all paths


Calling all Combinatorica pros! This is driving me nutty.

I'd like to find a way to get a list of all paths through a given
directed, acyclic graph. This would presumably be a list of lists of
integers, each list indicating a sequence of vertices.

I thought this might be something that would come up often enough to
warrant its own built-in function, but I couldn't find one. (There are
functions that will give you the "shortest" path, but not all paths.)
I also feel as though there must be certain built-in functions that
would make creating my own such "list all paths" function relatively
simple, but I don't know what they are either. It seems to me that
someone with more Mathematica programming experience than I have would
most likely look at this problem and come up with an idea for writing
such a function rather quickly. Any takers?

Thank you very much in advance,

Matt Enlow


  • Prev by Date: Re: save as pdf in version 6
  • Next by Date: Re: Quick Question
  • Previous by thread: align on equal signs with automatic equation numbering
  • Next by thread: Re: find all paths