{"repository":{"description":"Various python implementations for solving the classic TSP problem and exploring time complexities of different techniques for an algorithms design and analysis class.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":248,"owner":"oodabaga","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-04-10T18:41:19-07:00","pushed_at":"2013-05-05T22:26:29-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Scott Stevenson","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/oodabaga/TravelingSalesmanProblem/compare/0c48336cec...8684568e27"}