{"data":{"full_name":"magalhaesdavi/pathfinding-algorithms","name":"pathfinding-algorithms","description":"Python implementation and performance analysis of pathfinding algorithms. In this work the algorithms are used to find the shortest path from one city to another in a randomly generated graph. We also compare the cost and execution time of the solutions.","stars":1.0,"forks":0.0,"language":"Jupyter Notebook","license":"MIT","archived":0.0,"subcategory":"pathfinding-algorithm-implementations","last_pushed_at":"2022-02-07T13:56:26+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":1.0,"maturity_score":9.0,"community_score":0.0,"quality_score":10.0,"quality_tier":"experimental","risk_flags":"['stale_6m', 'no_package', 'no_dependents']"},"meta":{"timestamp":"2026-04-08T10:45:10.978859+00:00"}}