[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] k-shortest paths between two vertices
From: |
Tamás Nepusz |
Subject: |
Re: [igraph] k-shortest paths between two vertices |
Date: |
Sun, 9 Jan 2011 22:33:12 +0100 |
Hi Pasquale,
> 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.
> [...]
> Are there any news since then?
No, there aren't any -- you have to implement this yourself. The Python
solution you've seen on Stack Overflow is pretty self-explanatory once you
understand a bit of Python; if you have specific questions about it and need
some pointers to translate it to C, let me know.
--
Tamas