{"repository":{"description":"Computing a lower bound for the diameter of real life directed graph in linear time","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"valdelmeglio","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-08-25T16:50:18-07:00","pushed_at":"2013-08-25T16:50:18-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Valerio","email":"d79a2f77378d956f1c135d56f929b06ae6b9cf06@gmail.com"},"url":"https://github.com/valdelmeglio/DoubleSweep"}