{"repository":{"watchers":0,"forks":0,"owner":"marat-turaev","stargazers":0,"language":"C#","has_downloads":true,"created_at":"2012-11-05T08:15:52-08:00","fork":false,"size":144,"has_wiki":true,"has_issues":true,"description":"University task: implement some algorithms building minimum spanning tree","private":false,"open_issues":0,"pushed_at":"2012-11-07T11:25:55-08:00"},"actor_attributes":{"email":"6c4f03fad3fbfa2aea9aeaf374e5058f77f32f24@hotmail.com","name":"Marat Turaev","type":"User"},"url":"https://github.com/marat-turaev/SpanningTree/compare/f42bb554a6...8340cf1803"}