Package: cppRouting Type: Package Title: Algorithms for Routing and Solving the Traffic Assignment Problem Version: 4.1 Date: 2026-11-12 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) ), Customizable Contraction Hierarchies (J. Dibbelt, B. Strasser, D. Wagner (2014) ). License: GPL (>= 2) Encoding: UTF-8 Imports: Rcpp (>= 1.0.7), RcppParallel, data.table LinkingTo: Rcpp, RcppParallel, RcppProgress SystemRequirements: GNU make, zlib URL: https://github.com/vlarmet/cppRouting Suggests: knitr, rmarkdown, igraph, sf, osmextract, testthat (>= 3.0.0) VignetteBuilder: knitr NeedsCompilation: yes Config/roxygen2/version: 8.0.0 Config/testthat/edition: 3 Config/pak/sysreqs: cmake make zlib1g-dev Repository: https://vlarmet.r-universe.dev Date/Publication: 2026-11-12 09:31:57 UTC RemoteUrl: https://github.com/vlarmet/cpprouting RemoteRef: HEAD RemoteSha: ecfe6542931bab634136b455752496ed1194d075 Packaged: 2026-11-12 14:26:45 UTC; root Author: Vincent Larmet [aut, cre] Maintainer: Vincent Larmet