Re: [Jung-support] Longest Path Algorithm

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

Thanks for this Hussain. I really appreciate your help. I will give it a
try and let you know what it is doing for me.

Sincerely,

-Ahmed


On Mon, Nov 11, 2013 at 5:26 PM, Hussain Al-Mutawa <hus...@gm...
> wrote:

> You may look at this implementation of PathFinder which enumerates all
> paths between every pair of vertices. Not so efficient.
>
>
> https://code.google.com/p/tanglez/source/browse/trunk/src/nz/ac/massey/cs/tanglez/scc/PathFinder.java
>
> cheers, Hussain
>
>
> On Sat, Nov 9, 2013 at 4: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
>>
>>
>
>
> --
> (\__/)
> (='.'=)
> (")_(")
>
>
> ------------------------------------------------------------------------------
> 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
>
>