[GraphHopper] About fastest routing

[李杨]

you need read the CH algorithms
2014-4-28 PM2:23于 "Hao Pengzhan" <haopengzhan at 163.com>写道：

> Peter:
>
>          If we want to find a fastest path between source and target, it
> means every edge will have its own road’s general speed information. Then
> there would be two weights for each edge in the graph.
>
>          How GH achieve to calculate a fastest path ?
>
>
>
> Regards,
>
> Pengzhan.
>
>
>
> _______________________________________________
> GraphHopper mailing list
> GraphHopper at openstreetmap.org
> https://lists.openstreetmap.org/listinfo/graphhopper
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/graphhopper/attachments/20140428/dd82d71d/attachment.html>