{"repository":{"description":" A* (pronounced \"A star\") is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes. Noted for its performance and accuracy, it enjoys widespread use. (However, in practical travel-routing systems, it is generally outperformed by algorithms which can pre-process the graph to attain better performance","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":156,"owner":"samido","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Java","created_at":"2013-03-24T04:47:54-07:00","pushed_at":"2013-03-24T04:53:18-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/samido/A-Star-Algorithm/compare/84cc64c35c...9b27b45eb9"}