Fast Implementation of Dijkstra Algorithm

Calculation of distances, shortest paths and isochrones on weighted graphs using several variants of Dijkstra algorithm. Proposed algorithms are unidirectional Dijkstra (Dijkstra, E. W. (1959) ), bidirectional Dijkstra (Goldberg, Andrew & Fonseca F. Werneck, Renato (2005) <>), A* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968) ), new bidirectional A* (Pijls & Post (2009) <>), Contraction hierarchies (R. Geisberger, P. Sanders, D. Schultes and D. Delling (2008) ), PHAST (D. Delling, A.Goldberg, A. Nowatzyk, R. Werneck (2011) ).


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


2.0 by Vincent Larmet, 9 months ago

Browse source code at

Authors: Vincent Larmet

Documentation:   PDF Manual  

GPL (>= 2) license

Imports Rcpp, RcppParallel, RcppProgress, data.table

Suggests knitr, rmarkdown, igraph

Linking to Rcpp, RcppParallel, RcppProgress

System requirements: GNU make, C++11

See at CRAN