[GraphHopper] Routing with multi depots and depot priority

[Florian Schaetz]

Hello,

> it depends on the many-to-many query. Have a look into DijkstraOneToMany
> which basically reuses the shortest path tree of the start. But this
> algorithm is waste of memory if you only need a few points (compared to
> the total number of nodes in the graph), instead you could develop your
> own oneToMany algo based on hash maps instead of arrays.

Thanks for the hints. I was kind of hoping that someone already implemented a perfect solution, ready for use, but of course, no such luck ;-). Well, at least that's a start, we'll have look into it, but it's good to know that there's already something to start at.

Regards,

Flo