[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] k-shortest paths between two vertices

From: Pasquale D'Andreti
Subject: [igraph] k-shortest paths between two vertices
Date: Fri, 07 Jan 2011 12:33:44 +0100
User-agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv: Gecko/20101208 Thunderbird/3.1.7

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.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]