Re: [jgrapht-users] Question on JGraphT

[John V. S. <js...@gm...>]

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