osrm-backend/include/engine/routing_algorithms
Patrick Niklaus 655ca803d8 Adds a special graph for MLD with effcient boundary scan
This graph enables efficient boundary edge scans at each level.
Currenly this needs about |V|*|L| bytes of storage.
We can optimize this when the highest boundary nodes ID is << |V|.
2017-03-21 16:23:10 +00:00
..
alternative_path.hpp Addressed PR comments by @daniel-j-h and @oxidase 2017-03-03 16:02:12 +00:00
direct_shortest_path.hpp MLD direct shortest path plugin 2017-03-17 12:27:47 +01:00
many_to_many.hpp Addressed PR comments by @daniel-j-h and @oxidase 2017-03-03 16:02:12 +00:00
map_matching.hpp Fix formating 2017-03-03 16:02:12 +00:00
routing_base_ch.hpp MLD direct shortest path plugin 2017-03-17 12:27:47 +01:00
routing_base_mld.hpp Adds a special graph for MLD with effcient boundary scan 2017-03-21 16:23:10 +00:00
routing_base.hpp Split routing_base into CH and non-CH parts 2017-03-17 12:27:47 +01:00
shortest_path.hpp Addressed PR comments by @daniel-j-h and @oxidase 2017-03-03 16:02:12 +00:00
tile_turns.hpp Compute correct speed values in tile plugin 2017-03-09 11:18:53 +00:00