{"repository":{"description":"This solves an instance of the classic Euclidean Minimum Spanning Tree Problem using Rajasekaran's Algorithm.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":160,"owner":"manavcool","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-04-08T07:06:18-07:00","pushed_at":"2013-04-08T07:14:05-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Manav Sethi","company":"IIT Kharagpur","location":"Kharagpur","email":"954e26df9792caea4c7bfcd38cdfc0bac7aded01@gmail.com"},"url":"https://github.com/manavcool/EMST/compare/328523ae4a...c3958a8127"}