[igraph] k-shortest paths between two vertices

[Pasquale D'Andreti]

Hello list again...

I'm looking for a C function that help me to find the k-shortest paths 
between to vertices or, at least, to find (and enumerate) all paths 
between to vertices, preferably in form of edge sequence.

I found 
http://lists.nongnu.org/archive/html/igraph-help/2010-10/msg00105.html 
and stackoverlow.com answer by Jeremy W. Sherman but I am not fluent 
with python and I am currently working using C. I guess there was a 
recursive dfs.

Are there any news since then?

Thanks to you all in advance.

Pasquale