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|. |
||
---|---|---|
.. | ||
alternative_path.hpp | ||
direct_shortest_path.hpp | ||
many_to_many.hpp | ||
map_matching.hpp | ||
routing_base_ch.hpp | ||
routing_base_mld.hpp | ||
routing_base.hpp | ||
shortest_path.hpp | ||
tile_turns.hpp |