Package: cppRouting 3.1

Vincent Larmet

cppRouting: Algorithms for Routing and Solving the Traffic Assignment Problem

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>).

Authors:Vincent Larmet

cppRouting_3.1.tar.gz
cppRouting_3.1.zip(r-4.5)cppRouting_3.1.zip(r-4.4)cppRouting_3.1.zip(r-4.3)
cppRouting_3.1.tgz(r-4.4-x86_64)cppRouting_3.1.tgz(r-4.4-arm64)cppRouting_3.1.tgz(r-4.3-x86_64)cppRouting_3.1.tgz(r-4.3-arm64)
cppRouting_3.1.tar.gz(r-4.5-noble)cppRouting_3.1.tar.gz(r-4.4-noble)
cppRouting_3.1.tgz(r-4.4-emscripten)cppRouting_3.1.tgz(r-4.3-emscripten)
cppRouting.pdf |cppRouting.html
cppRouting/json (API)
NEWS

# Install 'cppRouting' in R:
install.packages('cppRouting', repos = c('https://fastverse.r-universe.dev', 'https://cloud.r-project.org'))

Peer review:

Bug tracker:https://github.com/vlarmet/cpprouting/issues

Uses libs:
  • c++– GNU Standard C++ Library v3

On CRAN:

algorithmalgorithm-bbidirectional-a-star-algorithmc-plus-pluscontraction-hierarchiesdijkstra-algorithmdistancefrank-wolfeisochronesparallel-computingrcppshortest-pathstraffic-assignment

12 exports 108 stars 7.25 score 4 dependencies 3 dependents 37 scripts 556 downloads

Last updated 4 months agofrom:b1715a8544. Checks:OK: 1 NOTE: 8. Indexed: no.

TargetResultDate
Doc / VignettesOKSep 16 2024
R-4.5-win-x86_64NOTESep 16 2024
R-4.5-linux-x86_64NOTESep 16 2024
R-4.4-win-x86_64NOTESep 16 2024
R-4.4-mac-x86_64NOTESep 16 2024
R-4.4-mac-aarch64NOTESep 16 2024
R-4.3-win-x86_64NOTESep 16 2024
R-4.3-mac-x86_64NOTESep 16 2024
R-4.3-mac-aarch64NOTESep 16 2024

Exports:assign_trafficcpp_contractcpp_simplifyget_aonget_detourget_distance_matrixget_distance_pairget_isochroneget_multi_pathsget_path_pairmakegraphto_df

Dependencies:data.tableRcppRcppParallelRcppProgress

cppRouting

Rendered fromcppRouting.Rmdusingknitr::rmarkdownon Sep 16 2024.

Last update: 2022-11-28
Started: 2022-11-28