[GraphHopper] Emergency brake to prevent out-of-memory?

[Peter K]

Hi Nop,

> It has plenty of heap space, little load and routing distance is
limited to 100km.

How do you limit it to 100km? You could modify your finish condition to
really limit the routing to 100km searches.

It could be that both points fall into separate regions and they won't
never find each other which results in traversing the full graph.
GraphHopper tries hard to avoid it via removing small subnetworks while
import but if you have islands we cannot remove everysubnetworks.
Additionally there are some improvements possible mentioned here:
https://github.com/graphhopper/graphhopper/issues/86

> Is there a way to limit the routing algorithm to just quit when the
results become too complex in order to prevent an out-of-memory?

No, but also the question is: what is too complex :) ? In the future I
would like to create an A* + Dijkstra which only utilizes the available
RAM which can be also very useful to perform none-CH routing on mobile
devices.

Regards,
Peter.

>
> Hi!
>
> My routing service occasionally stops with an out-of-memory error.
>
> It has plenty of heap space, little load and routing distance is
> limited to 100km. Therefore it could be a memory leak or a
> particularly tricky routing situation.
>
> Is there a way to limit the routing algorithm to just quit when the
> results become too complex in order to prevent an out-of-memory?
>
>
> bye
>                     Nop
>
>
> _______________________________________________
> GraphHopper mailing list
> GraphHopper at openstreetmap.org
> http://lists.openstreetmap.org/listinfo/graphhopper
>