cppRouting
3.2Algorithms for Routing and Solving the Traffic Assignment Problem
Overview
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://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.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).
Install
Health
- NOTE r-devel-linux-x86_64-fedora-clang
- NOTE r-devel-linux-x86_64-fedora-gcc
- NOTE2026-04-229 OK · 5 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- ERROR2026-04-188 OK · 5 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE
- NOTE2026-04-109 OK · 5 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- ERROR2026-04-098 OK · 5 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE
- NOTE2026-03-109 OK · 5 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
Documentation
- Examples that run
- 100%
- Documented parameters
- 100%
- Return-value docs
- 100%
- References docs
- 8%
Downloads
Repository
Stars over time
Forks over time
Releases over time
Issues over time
PRs over time
Repository practices
Checks run against github.com/vlarmet/cpprouting on 2026-07-19.
No development-tooling practices detected in the upstream repository.
Dependencies
Code & Tests
- Cyclomatic complexity
- 1.0 median / 32 max
- System requirements
- 1 external
Test coverage
Line coverage
–
Expression
–
Tests / Examples
–
Functions
202 12 exported
Complexity
6 avg / 32 max
Call network
202 nodes / 63 edges
Call graph
Open call graph →Lowest coverage
Per-function coverage is not measured for this package yet.
People & History
6 releases. Pick two to compare their code metrics. R releases are shown for context.
- RR 4.6.0 released · 2026-04-24
- 3.2Latest
- RR 4.5.0 released · 2025-04-11
- RR 4.4.0 released · 2024-04-24
- RR 4.3.0 released · 2023-04-21
- 3.12022-12-01 · diff ↗
- 3.02022-11-28 · diff ↗
- RR 4.2.0 released · 2022-04-22
- RR 4.1.0 released · 2021-05-18
- RR 4.0.0 released · 2020-04-24
- 2.02020-01-07 · diff ↗
- 1.22019-09-30 · diff ↗
- 1.12019-06-21
- RR 3.6.0 released · 2019-04-26
Package metadata
- First published
- 2019-06-21
- Total releases
- 6 / 7 yrs
- License
- GPL (>= 2) OSI
- Download size
- 66 KB
- Installed size
- not tracked yet
- With dependencies
- not tracked yet