Re: [igraph] Faster shortest paths when weights are bounded

[Gábor Csárdi]

No, we don't have this. I am not convinced that the algorithm in Section 2.1 would be much faster in practice, actually. Maybe it would, but fancy algorithms with (slightly) better theoretical time complexity are just impractical. 

Anyway, you can submit a feature request for this at http://github.com/igraph/igraph/issues. (Click on 'New issue'.) It helps if you argue that it is important to have this, and that it would be faster in practice. :)

BEst,

Gabor

On Tue, Oct 22, 2013 at 9:51 AM, Raphael C <address@hidden> wrote:

I was wondering if igraph had implemented within it any shortest path
algorithms which are faster when the edges have non-negative weights
and those weights are bounded.  For example section 2.1 of
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.228.5311&rep=rep1&type=pdf
.

Raphael

_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help