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. |
||
---|---|---|
.. | ||
api | ||
datafacade | ||
guidance | ||
plugins | ||
routing_algorithms | ||
douglas_peucker.cpp | ||
engine_config.cpp | ||
hint.cpp | ||
polyline_compressor.cpp | ||
search_engine_data.cpp |