cppRouting

cranv3.2

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

License GPL (>= 2)0 versions1 maintainers4 deps173 weekly dl
vlarmet/cppRouting
45
/ 100
Health
safe to use

[email protected] is safe to use (health: 45/100)

Health breakdown0 – 100
15/25
maintenance
3/20
popularity
25/25
security
0/15
maturity
2/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/cran/cppRouting

First published · 2025-11-28 11:52:41

Last updated · 2025-11-28T10:00:08+00:00

cppRouting — Health Score 45/100 | DepScope