[GraphHopper] Calculating fastest path with A*/Dijkstra with CH disabled

[mythex3cutioner .]

sorry, made a mistake, should be - but what about when it comes to
'FASTEST' path?


On Thu, Jan 9, 2014 at 3:22 PM, mythex3cutioner . <mizantropy at gmail.com>wrote:

> Hello everybody,
>
> I don't fully understand how does weighting works in Graphhopper.
> As for 'shortest' path it's, I think, easy - it just simply compares
> distances between nodes and that's it.
> but what about when it comes to 'shortest' path?
>
> Does the algorithm goes node by node and during each iteration it
> calculates time from distance & average speed for that node and then it
> compares those time values?
> Sorry if that's a dumb question but I just can't follow the code.
>
> my goal is to manipulate those time values a bit so I want to know where
> exactly should I do that? Inside Dijkstra.java or somehow during GHRequest?
>
> thank you
>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/graphhopper/attachments/20140109/542a1b85/attachment.html>