{"package":"cppRouting","ecosystem":"cran","latest_version":"3.2","description":"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)","license_risk":"unknown","commercial_use_notes":"verify manually — license not parseable / not declared.","homepage":"https://github.com/vlarmet/cppRouting","repository":"https://github.com/vlarmet/cppRouting","downloads_weekly":173,"health":{"score":45,"risk":"high","breakdown":{"maintenance":15,"popularity":3,"security":25,"maturity":0,"community":2},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"3.2","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2025-11-28 11:52:41","last_published":"2025-11-28T10:00:08+00:00","dependencies_count":4,"dependencies":["Rcpp","RcppParallel","RcppProgress","data.table"]},"github_stats":null,"bundle":null,"typescript":null,"known_issues":{"bugs_count":0,"bugs_severity":{},"status_breakdown":{},"link":null,"scope":"none"},"historical_compromise":null,"recommendation":{"action":"safe_to_use","issues":[],"use_version":"3.2","version_hint":null,"summary":"cppRouting@3.2 is safe to use (health: 45/100)"},"version_scoped":null,"requested_version":null,"_cache":"hit","_response_ms":0,"_powered_by":"depscope.dev — free package intelligence for AI agents","typosquat":{"is_suspected":false},"maintainer_trust":{"available":false},"malicious":{"is_malicious":false},"scorecard":{"available":false},"quality":{"available":false}}