The implementation code of paper "High Throughput Shortest Distance Query Processing for Large Dynamic Road Networks" (submitted to ICDE25). Please refer to the paper for the algorithm details.
The implementation code includes the index construction, query processing, and index update of our MHL, PMHL, and PostMHL algorithms.
The datasets of this paper are sourced from The 9th DIMACS Implementation Challenge - Shortest Paths (Link: www.dis.uniroma1.it/challenge9/download.shtml).
An example graph FLA is provided in the directory FLA for your reference. You can run our algorithms on the example graph by using the source path ./.
g++andboost
All the codes are runnable after cmake and make: go to the corresponding directory, cmake -DCMAKE_BUILD_TYPE=Release ./ and make -j.