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 [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
