bf2b45120a
For the MLD algorithm we can partition the NodeID range into boundary and non-boundary nodes. Since there are only we boundary nodes we can use the ArrayStorage for those yielding much faster query times. |
||
|---|---|---|
| .. | ||
| 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_impl.hpp | ||
| shortest_path.hpp | ||
| tile_turns.hpp | ||