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>), Contraction hierarchies (R. Geisberger, P. Sanders, D. Schultes and D. Delling (2008) <doi:10.1007/978-3-540-68552-4_24>), PHAST (D. Delling, A.Goldberg, A. Nowatzyk, R. Werneck (2011) <doi:10.1016/j.jpdc.2012.02.007>).
| Version: | 2.0 |
| Imports: | Rcpp (≥ 1.0.1), RcppParallel, RcppProgress , data.table |
| LinkingTo: | Rcpp, RcppParallel, RcppProgress |
| Suggests: | knitr, rmarkdown, igraph |
| Published: | 2020-01-07 |
| 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 |
| Citation: | cppRouting citation info |
| Materials: | NEWS |
| CRAN checks: | cppRouting results |
| Reference manual: | cppRouting.pdf |
| Vignettes: |
cppRouting |
| Package source: | cppRouting_2.0.tar.gz |
| Windows binaries: | r-devel: cppRouting_2.0.zip, r-release: cppRouting_2.0.zip, r-oldrel: cppRouting_2.0.zip |
| macOS binaries: | r-release: cppRouting_2.0.tgz, r-oldrel: cppRouting_2.0.tgz |
| Old sources: | cppRouting archive |
Please use the canonical form https://CRAN.R-project.org/package=cppRouting to link to this page.