Base on https://github.com/cetusteam/contraction-hierarchies
This program allows to create and test contraction hierarchies (CH), a hierarchical, shortcut-based speedup technique for fast and simple routing in road networks.
Papers: - R. Geisberger, P. Sanders, D. Schultes, D. Delling. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In 7th International Workshop on Efficient and Experimental Algorithms (WEA), 2008.
- STL
- Boost IO-streams & regular expressions (only for input/output)
use Clion
Use for fast many to many shortest path query - output path
In newexample folder
Input: graph.ddsg query.txt
Output:result.txt 3 lines for 1 query
- Source Target Length
- Path Nodes
- Path Edges Weight