Package: cppRouting
Type: Package
Title: Fast Implementation of Dijkstra Algorithm
Version: 1.2
Date: 2019-09-25
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>). 
License: GPL (>= 2)
Imports: Rcpp (>= 1.0.1), parallel
LinkingTo: Rcpp
SystemRequirements: GNU make, C++11
RoxygenNote: 6.1.1
URL: https://github.com/vlarmet/cppRouting
Suggests: knitr, rmarkdown, igraph
VignetteBuilder: knitr
NeedsCompilation: yes
Packaged: 2019-09-25 13:04:02 UTC; vlarmet
Repository: CRAN
Date/Publication: 2019-09-30 09:20:02 UTC
