{"repository":{"description":"these two algorithms battle for supremacy, you can specify a graph and see when they explode!","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":116,"owner":"mettledrum","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-03-17T09:49:28-07:00","pushed_at":"2013-03-17T09:53:42-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Andrew","blog":"http://mettledrumisbuildingthings.blogspot.com/","location":"Denver","email":"8ff0c9d2b5181b473c6b5a2e22faec38518696f9@gmail.com"},"url":"https://github.com/mettledrum/Dijkstra_vs_Bellman-Ford/compare/0056f7eea8...787b39d6cf"}