Re: [Jung-support] Longest Path Algorithm

[Ahmed A. H. <ahm...@gm...>]

Thanks for this!

Is there another path finding algorithm that takes a start node and an end
node to determine whether there is a path, and also returns possible paths?
Does the current implementation of Dijkstra's provide this?

Thanks again!


-Ahmed


On Mon, Nov 11, 2013 at 12:06 AM, Joshua O'Madadhain <
jos...@gm...> wrote:

> No, JUNG does not provide implementations of any worst-case
> exponential-time algorithms:
> http://en.wikipedia.org/wiki/Longest_path_problem
>
> Joshua
>
>
> On Fri, Nov 8, 2013 at 7:01 PM, Ahmed Abdeen Hamed <
> ahm...@gm...> wrote:
>
>> Hey guys,
>>
>> Does JUNG have an implementation of a Longest Path algorithm?
>>
>> Thanks in Advance!
>>
>> -Ahmed
>>
>>
>> ------------------------------------------------------------------------------
>> November Webinars for C, C++, Fortran Developers
>> Accelerate application performance with scalable programming models.
>> Explore
>> techniques for threading, error checking, porting, and tuning. Get the
>> most
>> from the latest Intel processors and coprocessors. See abstracts and
>> register
>>
>> http://pubads.g.doubleclick.net/gampad/clk?id=60136231&iu=/4140/ostg.clktrk
>> _______________________________________________
>> Jung-support mailing list
>> Jun...@li...
>> https://lists.sourceforge.net/lists/listinfo/jung-support
>>
>>
>
>
> --
> jos...@gm.........sites.google.com/site/joshuaomadadhain/
>    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.
>