[Routing] Fellow mappers, , , I have the pleasure to announce the initial release of a high-perfomance, routing backend

[Dennis Luxen]

> actually, I believe that an algorithm like the contraction hierarchies
> could be a perfect candidate for a mobile device.

Indeed.

> Indeed its great strength is to visit very few nodes and thus it might
> work to have the whole graph on a memory card and not loading it in
> memory. Obviously the preprocessing must be done on a desktop
> computer.

That's right. Preprocessing has to be done on a desktop machine.

> Of course it will require some heavy adaption on the graph structure...

Yes, you are right. On a mobile device you want to avoid random accesses to the data structure, because RAM is scarce and I/O is pretty expensive. The good news is that it is perfectly possible to rearrange the data structures in a way that only a handful of I/Os are necessary to compute a route.

--Dennis