{"repository":{"description":"Some quick&dirty C code to calculate mst weights of (pseudo) random graphs","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":120,"owner":"bcleenders","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C","created_at":"2013-10-16T16:54:09-07:00","pushed_at":"2013-10-25T13:01:39-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Bram","company":"University of Twente","location":"Enschede, Netherlands","email":"c74b0df0a7d906f5b1e6b4e275546b27c2d1becc@gmail.com"},"url":"https://github.com/bcleenders/minimum-spanning-tree/pull/1"}