{"repository":{"description":"The infamous Traveling Salesman Problem solved by different algorithms: Dynamic Programming, Backtracking and Branch & Bound.","homepage":"","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":140,"owner":"chintux","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C","created_at":"2013-05-23T02:45:58-07:00","pushed_at":"2013-06-10T22:48:04-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/chintux/tsp-algorithms/compare/67a6aeb201...6ec2449b07"}