{"repository":{"description":"Some experimental code (from my childhood as programmer) to solve the popular TSP problem and the not so popular printing of All MSTs in an undirected graph","homepage":"","watchers":1,"stargazers":1,"forks":0,"fork":false,"size":1080,"owner":"cdparra","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Java","created_at":"2011-03-19T07:16:18-07:00","pushed_at":"2013-11-11T04:20:22-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Cristhian Parra","company":"University of Trento","blog":"http://disi.unitn.it/~parra/","location":"Trento, Italy","email":"84b8cc2f5c953890ccd2d69d64c80f03410d8a1a@gmail.com"},"url":"https://github.com/cdparra/tsp-allmst/compare/aed01f82b7...a41d1f170a"}