Re: [jgrapht-users] Question on JGraphT

[gu b. <bou...@ya...>]

Hi,
 
I'm Implmentation

--- En date de : Mer 4.3.09, John V. Sichi <js...@gm...> a écrit :

De: John V. Sichi <js...@gm...>
Objet: Re: Question on JGraphT
À: lef...@ya...
Cc: jgr...@li..., bou...@ya...
Date: Mercredi 4 Mars 2009, 1h09

Olivier Lefevre wrote:
> Hi,
> 
> What is the algorithm used for K-shortest paths in JGraphT: the REA
algorithm of Jimenez and Marzal?
> 
> Regards,
> 
> Olivier Lefevre
> Freelance bioinformatics developer
> Berlin, Germany

Greetings Olivier,

I don't know the answer, so I'm cc'ing your question to the users
mailing list, as well as Guillaume Boulmier, who developed this code.

Jimenez and Marzal is O(m+Knlog(m/n)), whereas Guillaume's comments have
O(K*m*n) for the running time.

JVS