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 (doi:10.1007/BF01386390), bidirectional Dijkstra (https://archive.siam.org/meetings/alenex05/papers/03agoldberg.pdf), A* search (doi:10.1109/TSSC.1968.300136), new bidirectional A* (https://repub.eur.nl/pub/16100/ei2009-10.pdf), Contraction hierarchies (doi:10.1007/978-3-540-68552-4_24), PHAST (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 (doi:10.1016/0191-2615(84)90029-8), Conjugate and Bi-Conjugate Frank-Wolfe algorithms (doi:10.1287/trsc.1120.0409), Algorithm-B (doi:10.1016/j.trb.2006.02.008).
- Version3.1
- R versionunknown
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?Yes
- Last release12/01/2022
Documentation
Team
Vincent Larmet
Insights
Last 30 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports4 packages
- Suggests3 packages
- Linking To3 packages
- Reverse Imports3 packages