A proof-of-concept experiment on reusing the shortest path tree during the execution of Dijkstra's algorithm on a sequence of vertices is presented. This approach has the potential to accelerate the precomputation of Compressed Path Databases.
-
build:
- clean:
make clean - dev:
make dev - fast:
make fast - test:
make test(fastwithout-DNDEBUG)
- clean:
-
run executable:
./bin/main