@@ -6,16 +6,19 @@ Date: 2019-12-06
66Author: Vincent Larmet
77Maintainer: Vincent Larmet <
[email protected] >
88Description: Calculation of distances, shortest paths and isochrones on weighted graphs using several variants of Dijkstra algorithm.
9- Proposed algorithms are unidirectional Dijkstra (Dijkstra, E. W. (1959) <doi:10.1007/BF01386390>),
10- bidirectional Dijkstra (Goldberg, Andrew & Fonseca F. Werneck, Renato (2005) <https://pdfs.semanticscholar.org/0761/18dfbe1d5a220f6ac59b4de4ad07b50283ac.pdf>),
11- A* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968) <doi:10.1109/TSSC.1968.300136>),
12- new bidirectional A* (Pijls & Post (2009) <http://repub.eur.nl/pub/16100/ei2009-10.pdf>),
13- Contraction hierarchies (R. Geisberger, P. Sanders, D. Schultes and D. Delling (2008) <doi:10.1007/978-3-540-68552-4_24>).
9+ Proposed algorithms are unidirectional Dijkstra (Dijkstra, E. W. (1959) <doi:10.1007/BF01386390>),
10+ bidirectional Dijkstra (Goldberg, Andrew & Fonseca F. Werneck, Renato (2005) <https://pdfs.semanticscholar.org/0761/18dfbe1d5a220f6ac59b4de4ad07b50283ac.pdf>),
11+ A* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968) <doi:10.1109/TSSC.1968.300136>),
12+ new bidirectional A* (Pijls & Post (2009) <http://repub.eur.nl/pub/16100/ei2009-10.pdf>),
13+ Contraction hierarchies (R. Geisberger, P. Sanders, D. Schultes and D. Delling (2008) <doi:10.1007/978-3-540-68552-4_24>).
1414License: GPL (>= 2)
1515Imports: Rcpp (>= 1.0.1), RcppParallel, RcppProgress , data.table
1616LinkingTo: Rcpp, RcppParallel, RcppProgress
1717SystemRequirements: GNU make, C++11
1818RoxygenNote: 6.1.1
1919URL: https://github.com/vlarmet/cppRouting
20- Suggests:knitr, rmarkdown, igraph
20+ Suggests:
21+ knitr,
22+ rmarkdown,
23+ igraph
2124VignetteBuilder: knitr
0 commit comments