{"data":{"full_name":"arjun-krishna/TSP","name":"TSP","description":"Ant Colony Optimization and Simulated Annealing implemented in C++ for solving the Travelling Salesman Problem","stars":7.0,"forks":5.0,"language":"C++","license":"MIT","archived":0.0,"subcategory":"metaheuristic-optimization","last_pushed_at":"2021-03-19T13:00:50+00:00","pypi_package":null,"npm_package":null,"downloads_monthly":0.0,"dependency_count":0.0,"commits_30d":null,"reverse_dep_count":0.0,"maintenance_score":0.0,"adoption_score":4.0,"maturity_score":9.0,"community_score":15.0,"quality_score":28.0,"quality_tier":"experimental","risk_flags":"['stale_6m', 'no_package', 'no_dependents']"},"meta":{"timestamp":"2026-04-06T18:47:36.864472+00:00"}}