Shortest Path and Distance Queries

Brought to you by: xkxiao

Last Update: 2015-03-17

This is the code used in the experiments of the following paper:

Lingkun Wu, Xiaokui Xiao, Dingxiong Deng, Gao Cong, Andy Diwen Zhu, Shuigeng Zhou: Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation. PVLDB 5(5): 406-417 (2012)

Please cite the paper if you choose to use the code

Project Activity

See All Activity >

Follow Shortest Path and Distance Queries

Shortest Path and Distance Queries Web Site

Other Useful Business Software

Earn up to 16% annual interest with Nexo.

Access competitive interest rates on your digital assets.

Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.

Get started with Nexo.

Rate This Project

User Reviews

Be the first to post a review of Shortest Path and Distance Queries!

Additional Project Details

Registered

2011-11-04

Report inappropriate content

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Start Free

Recommended Projects

Dijkstra shortest path algorithm
Simple Dijkstra shortest path implementation - for learning and teaching
Distance Scaling
A Distance Scaling Method to Improve Density-Based Clustering
TOL
Total Order Labeling for Reachability Queries on Large Dynamic Graphs
Influence Maximization via Martingales
This is the code used in the experiments of the following paper: Youze Tang, Yanchen Shi, and Xiaokui Xiao. "Influence Maximization in Near-Linear Time: A Martingale Approach." Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM, 2015. Please cite the paper if you choose to use the code.
knight-path
The knight-path program is used to find shortest path of a knight chess piece between two chess board positions.