cppRouting: 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) <doi:10.1007/BF01386390>), bidirectional Dijkstra (Goldberg, Andrew & Fonseca F. Werneck, Renato (2005) <https://pdfs.semanticscholar.org/0761/18dfbe1d5a220f6ac59b4de4ad07b50283ac.pdf>), A* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968) <doi:10.1109/TSSC.1968.300136>), new bidirectional A* (Pijls & Post (2009) <http://repub.eur.nl/pub/16100/ei2009-10.pdf>).

Version: 1.1
Imports: Rcpp (≥ 1.0.1), parallel
LinkingTo: Rcpp
Suggests: knitr, rmarkdown, igraph
Published: 2019-06-21
Author: Vincent Larmet
Maintainer: Vincent Larmet <larmet.vincent at gmail.com>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
URL: https://github.com/vlarmet/cppRouting
NeedsCompilation: yes
SystemRequirements: GNU make, C++11
CRAN checks: cppRouting results


Reference manual: cppRouting.pdf
Vignettes: cppRouting
Package source: cppRouting_1.1.tar.gz
Windows binaries: r-devel: cppRouting_1.1.zip, r-release: cppRouting_1.1.zip, r-oldrel: cppRouting_1.1.zip
OS X binaries: r-release: cppRouting_1.1.tgz, r-oldrel: cppRouting_1.1.tgz


Please use the canonical form https://CRAN.R-project.org/package=cppRouting to link to this page.