Package: cppRouting Type: Package Title: Algorithms for Routing and Solving the Traffic Assignment Problem Version: 3.2 Date: 2025-11-28 Authors@R: person(given = "Vincent",family = "Larmet",role = c("aut", "cre"),email = "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) ), 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) ). 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/vlarmet/cppRouting Suggests: knitr, rmarkdown, igraph VignetteBuilder: knitr NeedsCompilation: yes Config/pak/sysreqs: make zlib1g-dev Repository: https://fastverse.r-universe.dev Date/Publication: 2025-11-28 10:25:32 UTC RemoteUrl: https://github.com/vlarmet/cppRouting RemoteRef: HEAD RemoteSha: d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf Packaged: 2026-06-09 14:01:15 UTC; root Author: Vincent Larmet [aut, cre] Maintainer: Vincent Larmet