Package: cppRoutingCCH Type: Package Title: Algorithms for Routing and Solving the Traffic Assignment Problem Version: 3.2.1 Date: 2026-07-07 Authors@R: c( person(given = "Vincent", family = "Larmet", role = "aut", email = "larmet.vincent@gmail.com"), person(given = "Félix", family = "Pouchain", role = c("aut", "cre"), email = "flx.pouchain@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) ), bidirectional Dijkstra (Goldberg, Andrew & Fonseca F. Werneck, Renato (2005) ), A* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968) ), new bidirectional A* (Pijls & Post (2009) ), Contraction hierarchies (R. Geisberger, P. Sanders, D. Schultes and D. Delling (2008) ), PHAST (D. Delling, A.Goldberg, A. Nowatzyk, R. Werneck (2011) ), and customizable contraction hierarchies for repeated edge-cost updates on stable graph topologies. Algorithms for solving the traffic assignment problem are All-or-Nothing assignment, Method of Successive Averages, Frank-Wolfe algorithm (M. Fukushima (1984) ), Conjugate and Bi-Conjugate Frank-Wolfe algorithms (M. Mitradjieva, P. O. Lindberg (2012) ), Algorithm-B (R. B. Dial (2006) ). License: GPL (>= 2) Encoding: UTF-8 Imports: Rcpp (>= 1.0.7), RcppParallel, RcppProgress, data.table LinkingTo: Rcpp, RcppParallel, RcppProgress SystemRequirements: GNU make RoxygenNote: 7.2.1 URL: https://github.com/mobility-team/cppRoutingCCH Suggests: knitr, rmarkdown, igraph VignetteBuilder: knitr NeedsCompilation: yes Config/pak/sysreqs: make Repository: https://mobility-team.r-universe.dev Date/Publication: 2026-07-07 15:40:28 UTC RemoteUrl: https://github.com/mobility-team/cppRoutingCCH RemoteRef: HEAD RemoteSha: 95d95f355569dbfb978030023f39eab3201a68e6 Packaged: 2026-07-07 15:46:02 UTC; root Author: Vincent Larmet [aut], Félix Pouchain [aut, cre] Maintainer: Félix Pouchain