k Shortest Paths

[Prudhvi Boyapalli <prb2 AT rice.edu>]

Hello,

I noticed that there is no implementation in gs-algo for a "k-shortest paths” type algorithm. I was wondering if any GraphStream users had an implementation they wouldn’t mind sharing or any advice for implementing it myself. Specifically, I’m interested in implementing Eppstein’s k Shortest Paths algorithm (https://static.aminer.org/pdf/PDF/001/059/121/finding_the_k_shortest_paths.pdf), but any similar algorithms would also be appreciated.

Thanks,

Prudhvi Boyapalli