[pgrouting-users] Multiple Origins/Multiple Destinations

[Spencer Gardner]

Is there an efficient strategy for obtaining the shortest route from
multiple origins to multiple destinations?

To be clear, I'm *not *talking about returning a shortest route for the
pairing of each origin to each destination. (This is the current behavior
when arrays are passed in for start and end vertices.) What I *am *talking
about is returning a single shortest route that represents the shortest of
all possibilities between the origin and destination vertices.

I hope that makes sense.

Thanks,
Spencer
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-users/attachments/20170330/17b04727/attachment.html>