Pruned Highway Labeling
Pruned Highway Labeling is a shortest-path distance querying algorithm for road networks.
$ make $ bin/construct graph_file label_file $ bin/query label_file
maketo build programs.
constructto construct labels for a graph.
queryto query distance between two vertices.
- In a graph file, each line should contain two vertices, travel time and geometrical length (see
- Vertices should be described by integers starting from zero.
benchmark.cpp for detailed information.
- Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, and Yuki Kawata, Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. In ALENEX 2014.