{"package":"TSP","ecosystem":"cran","latest_version":"1.2.7","description":"Infrastructure for the Traveling Salesperson Problem. Basic infrastructure and some algorithms for the traveling salesperson problem (also traveling salesman problem; TSP). The package provides some simple algorithms and an interface to the Concorde TSP solver and its implementation of the Chained-Lin-Kernighan heuristic. The code for Concorde itself i","license":"GPL-3","license_risk":"strong_copyleft","commercial_use_notes":"GPL-3.0: derivative works must release source under GPL; includes explicit patent grant.","homepage":"https://github.com/mhahsler/TSP","repository":"https://github.com/mhahsler/TSP","downloads_weekly":9943,"health":{"score":53,"risk":"high","breakdown":{"maintenance":20,"popularity":6,"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":"1.2.7","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2026-03-23 06:50:57","last_published":"2026-03-23T05:40:20+00:00","dependencies_count":5,"dependencies":["graphics","foreach","utils","stats","grDevices"]},"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":"1.2.7","version_hint":null,"summary":"TSP@1.2.7 is safe to use (health: 53/100)"},"version_scoped":null,"requested_version":null,"_cache":"miss","_response_ms":461,"_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}}