[pgrouting-users] dijkstra for MANY sources
brian at derocher.org
Sun Nov 13 23:12:30 PST 2016
Can someone give me some guidance. I'm looking for the right algorithm to use when solving this problem. I want to find the distance and shortest path to 11 schools for about 15,000 students. Does the many to many flavor of dijkstra scale up to these numbers? Is there a better way to solve this?
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 801 bytes
Desc: This is a digitally signed message part.
More information about the Pgrouting-users