{"repository":{"description":"An interactive understanding of the symmetric Travel Salesman Problem using dynamic programming","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":216,"owner":"mirkopepper","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-10-07T21:09:59-07:00","pushed_at":"2013-10-08T09:56:10-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/mirkopepper/tsp-qt/compare/2ace254379...bb7dfee4a9"}