Fast shortest-path distance querying on road networks
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
sample
src
LICENSE
Makefile
README.md

README.md

Pruned Highway Labeling

Pruned Highway Labeling is a shortest-path distance querying algorithm for road networks.

Usage

$ make
$ bin/construct graph_file label_file
$ bin/query label_file
  • Execute make to build programs.
  • Execute construct to construct labels for a graph.
  • Execute query to query distance between two vertices.
  • In a graph file, each line should contain two vertices, travel time and geometrical length (see sample_graph.tsv).
  • Vertices should be described by integers starting from zero.

Please see pruned_highway_labeling.h and benchmark.cpp for detailed information.

References