[GraphHopper] About fastest routing

[Hao Pengzhan]

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.

 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/graphhopper/attachments/20140428/cef79bd0/attachment.html>