[pgrouting-users] dijkstra for MANY sources

[Brian DeRocher]

Hey there,

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?

Thanks,
Brian

-- 
Brian DeRocher
http://brian.derocher.org
http://mappingdc.org
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 801 bytes
Desc: This is a digitally signed message part.
URL: <http://lists.osgeo.org/pipermail/pgrouting-users/attachments/20161114/1278fbc4/attachment.sig>