{"repository":{"description":"Final year academic project to cover all the edges of a given graph using minimum number of paths keeping the total path weight within a given constraint Q.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":144,"owner":"anuj-kumar","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-09-03T00:43:08-07:00","pushed_at":"2013-09-03T05:27:25-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Anuj Kumar","location":"Durgapur, India","email":"13253a69f0bdc6ce0302bf56f9b911d8c9b2a2cc@gmail.com"},"url":"https://github.com/anuj-kumar/min_postmen_cover/compare/82dbabbb97...60bc9cdf9c"}