Patrick Niklaus bf2b45120a Use ArrayStorage for boundary nodes to optimize MLD ... 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.		2018-04-09 15:08:00 +02:00
..
alternative_path.hpp	Add abstraction to change the data facade at compile time	2017-07-17 11:40:55 +00:00
direct_shortest_path.hpp	fallback to CH, when coreCH used	2017-10-13 14:53:49 +01:00
many_to_many.hpp	Prepare phantom nodes indices in ManyToManySearch search	2017-10-11 16:28:16 +01:00
map_matching.hpp	Add abstraction to change the data facade at compile time	2017-07-17 11:40:55 +00:00
routing_base_ch.hpp	fallback to CH, when coreCH used	2017-10-13 14:53:49 +01:00
routing_base_mld.hpp	Don't force loops in MLD	2017-10-03 12:56:50 +02:00
routing_base.hpp	Use ranges with fixed types	2018-04-09 11:05:01 +02:00
shortest_path_impl.hpp	Use ArrayStorage for boundary nodes to optimize MLD	2018-04-09 15:08:00 +02:00
shortest_path.hpp	Remove references to external sources	2017-08-14 16:18:36 +02:00
tile_turns.hpp	Split intersection analysis and guidance code	2018-02-02 11:33:38 -05:00