[GraphHopper] Information about graphhopper algorithms

[Angelo Immediata]

Hi

First of all compliments for the GraphHopper Routing Machine...it's really
amazing

We are thinking to use it in our scenario; since in our case we can't use
the CH algorithm due to the fact that we have highly dinamyc weight values,
we are thinking to use the Dijkstra-based algorithms (let's call them so)
like A*, Bi-directional Dijkstra and so on...
In order to not use the CH algorithm Peter suggested to us to specify
prepare.chShortcuts=no in the config.properties file

We did it and we are checking the algorithms...in our case we should also
provide:
multiple paths from node A to node B
multimodal paths from node A to node B

What I mean is that when we calculate the route from point A to point B we
should be able in providing:
multiple paths and che client can choose the wished one
multimodal path: a path composed by some "cars" ways, "pediastran" ways,
"cycle" ways and so on....

It seems to us that the previously listed cases are not possible in
GraphHopper (above all the possibility to return a list of Path)....Is this
correct?
If it's correct.....are you thinking to implement them? Can we find any
kind of implementation anywhere?

Thank you
Angelo
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/graphhopper/attachments/20140116/1843e871/attachment.html>