Finding the Time-Dependent Shortest Path over Large Graphs in Python
This repository is inspired by the following paper:
@inproceedings{Ding:2008:FTS:1353343.1353371,
author = {Ding, Bolin and Yu, Jeffrey Xu and Qin, Lu},
title = {Finding Time-dependent Shortest Paths over Large Graphs},
booktitle = {Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology},
series = {EDBT '08},
year = {2008},
isbn = {978-1-59593-926-5},
location = {Nantes, France},
pages = {205--216},
numpages = {12},
url = {http://doi.acm.org/10.1145/1353343.1353371},
doi = {10.1145/1353343.1353371},
acmid = {1353371},
publisher = {ACM},
address = {New York, NY, USA},
}