{"repository":{"description":"Shortest path computation using Go and Contraction Hierarchies.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":232,"owner":"co-sky-developers","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C","created_at":"2013-10-25T03:58:45-07:00","pushed_at":"2013-10-25T04:36:17-07:00","master_branch":"master","organization":"co-sky-developers"},"actor_attributes":{"type":"User","name":"Antoine Kalmbach","location":"Jyväskylä, Finland","email":"59eaddc432b04c41e53a0a7c614648fec10a5077@iki.fi"},"url":"https://github.com/co-sky-developers/via/compare/24ebdb622f...89769f9112"}