[GraphHopper] About fastest routing

Peter K peathal at yahoo.de
Mon Apr 28 10:00:08 UTC 2014


Hey Pengzhan,

If you have CH disabled you can choose while querying if you use
Shortest- or FastestWeighting (you can also import multiple vehicles).

But if you enable CH you can only have either fastest or shortest
weighting (and use only one vehicle).

> Then there would be two weights for each edge in the graph.

Speed can be calculated on demand or stored in the edge - this depends
on your requirements.

Regards,
Peter.

> you need read the CH algorithms
>
> 2014-4-28 PM2:23? "Hao Pengzhan" <haopengzhan at 163.com
> <mailto: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.
>

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


More information about the GraphHopper mailing list