Package: cppRouting
Type: Package
Title: Algorithms for Routing and Solving the Traffic Assignment
        Problem
Version: 3.1
Date: 2022-11-28
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://archive.siam.org/meetings/alenex05/papers/03agoldberg.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) <https://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>).
    Algorithms for solving the traffic assignment problem are All-or-Nothing assignment,
    Method of Successive Averages,
    Frank-Wolfe algorithm (M. Fukushima (1984) <doi:10.1016/0191-2615(84)90029-8>),
    Conjugate and Bi-Conjugate Frank-Wolfe algorithms (M. Mitradjieva, P. O. Lindberg (2012) <doi:10.1287/trsc.1120.0409>),
    Algorithm-B (R. B. Dial (2006) <doi:10.1016/j.trb.2006.02.008>).
License: GPL (>= 2)
Encoding: UTF-8
Imports: Rcpp (>= 1.0.7), RcppParallel, RcppProgress, data.table
LinkingTo: Rcpp, RcppParallel, RcppProgress
SystemRequirements: GNU make, C++11
RoxygenNote: 7.2.1
URL: https://github.com/vlarmet/cppRouting
Suggests: knitr, rmarkdown, igraph
VignetteBuilder: knitr
NeedsCompilation: yes
Packaged: 2022-11-29 07:45:49 UTC; vincent
Repository: CRAN
Date/Publication: 2022-12-01 13:20:02 UTC
Built: R 4.4.0; x86_64-apple-darwin20; 2024-05-30 11:02:36 UTC; unix
Archs: cppRouting.so.dSYM
