Package: cppRouting
Type: Package
Title: Fast Implementation of Dijkstra Algorithm
Version: 2.0
Date: 2019-12-06
Author: Vincent Larmet
Maintainer: Vincent Larmet <larmet.vincent@gmail.com>
Description: 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>).
License: GPL (>= 2)
Imports: Rcpp (>= 1.0.1), RcppParallel, RcppProgress , data.table
LinkingTo: Rcpp, RcppParallel, RcppProgress
SystemRequirements: GNU make, C++11
RoxygenNote: 6.1.1
URL: https://github.com/vlarmet/cppRouting
Suggests: knitr, rmarkdown, igraph
VignetteBuilder: knitr
NeedsCompilation: yes
Packaged: 2020-01-07 10:31:24 UTC; vlarmet
Repository: CRAN
Date/Publication: 2020-01-07 17:00:10 UTC
Built: R 4.1.0; x86_64-w64-mingw32; 2020-08-03 04:27:40 UTC; windows
Archs: i386, x64
