Re: [Jung-support] getting all simple paths in a directed graph

[guille l. <gui...@gm...>]

ok, thanks for the info.

guille

2009/12/15 Joshua O'Madadhain <jos...@gm...>:
> On Mon, Dec 14, 2009 at 9:43 AM, guille lists <gui...@gm...> wrote:
>> thanks for the response,
>>
>> 2009/12/14 Joshua O'Madadhain <jos...@gm...>:
>>> JUNG doesn't support this: there are an exponential number of such paths.
>>
>> ok, thanks. I know there are exponential number of paths, I just want
>> to test it in several relatively small and sparse graphs.
>>
>>> What problem are you trying to solve?
>>
>> it is not for a concrete problem, i just need to get all paths between
>> two given vertexs and then do some computations for each path. Again,
>> regardless of its complexity, i'm just interested in doing it, as:
>> http://www.itl.nist.gov/div897/sqg/dads/HTML/allSimplePaths.html
>
> The definition is clear, thanks, and you can write the code to do this
> using JUNG if you like.  As you noted, we don't have a generic DFS
> implementation, but it's not hard to write one.  But I don't expect
> that we'll be providing an implementation ourselves anytime in the
> easily foreseeable future.
>
> If you run into problems implementing this yourself, let us know and
> perhaps we can help.
>
> Joshua
>
>>
>> guille
>>
>
>
>
> --
>  jos...@gm......................www.ics.uci.edu/~jmadden
>   Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall
> It's that moment of dawning comprehension that I live for.  -- Bill Watterson
>  My opinions are too rational and insightful to be those of any organization.
>