|
| From: | Raphael C |
| Subject: | [igraph] Faster shortest paths when weights are bounded |
| Date: | Tue, 22 Oct 2013 14:51:52 +0100 |
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
| [Prev in Thread] | Current Thread | [Next in Thread] |