{"repository":{"description":"Solve the traveling salesman problem for extremely large graphs directly.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":124,"owner":"raytrace","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-04-10T08:44:22-07:00","pushed_at":"2013-04-10T09:14:45-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/raytrace/TSP/compare/6647f336fc...a1e339718c"}