Awesome. Thanks for that.
One question though. Apart from the edge filter which will make Dijkstra
calculation faster, can I also get around storing lots of Inf values in an
edgepropertymap ? Suppose, I only want to route along highways. Right now, I
would have an edgepropertymap with 98% inf
Am 03.06.20 um 10:26 schrieb Mathias Versichele:
> Anyone that can help me out ? There must be something I'm missing, or there
> must be an easy fix. Any help would be greatly appreciated.
This is a numerical precision problem. You have very low edge weights
(1e-6) combined with very large values
Anyone that can help me out ? There must be something I'm missing, or there
must be an easy fix. Any help would be greatly appreciated.
--
Sent from:
http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/
___
graph-tool mailing
Maybe someone can help me out with this problem I posted on StackOverFlow:
https://stackoverflow.com/questions/61955566/distance-map-returned-from-shortest-distance-function-misses-entries-of-certain
Basically, I discovered that a call to shortest_distance returns a distance
map where certain
