{"repository":{"watchers":1,"owner":"adi3","created_at":"2012-11-22T18:02:56-08:00","stargazers":1,"description":"An application to find the shortest path between any two selected nodes in a given graph.","has_issues":true,"has_downloads":true,"pushed_at":"2012-11-22T18:09:30-08:00","forks":0,"open_issues":0,"fork":false,"size":304,"has_wiki":true,"language":"C++","private":false},"actor_attributes":{"location":"California, USA","type":"User","name":"Adi Singh","company":"Stanford University","email":"712071c14f98a767baec64fcd196142598519f71@gmail.com"},"url":"https://github.com/adi3/pathfinder/compare/29288414e5...a827e08816"}