[Routing] Fast Routing Engine - State of Play

[Jens Müller]

Am 01.04.2010 15:43, schrieb Dennis Luxen:
> The engine is based on the Contraction Hierarchies algorithm published
> by Geisberger et al. in 2008 (http://algo2.iti.kit.edu/1087.php).

As you have probably looked into that in quite some detail: Is it 
necessary to do precomputations for every edge length function to be 
used (e.g., car, pedestrian, mountain bike, racing bike, $userdefined)? 
Or can the algorithm deal with small modifications?

Thanks,

Jens