{"repository":{"description":"This is a program implemented for University to generate paths for the Travelling Salesperson 2D problem. The program will for a map have a two second constraint, thus it assumes maps not to be bigger then 1000 cities.","watchers":0,"stargazers":0,"forks":0,"fork":true,"size":162,"owner":"Tethik","private":false,"open_issues":0,"has_issues":false,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-11-14T14:14:48-08:00","pushed_at":"2013-12-03T03:52:33-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Joakim Uddholm","company":"Payson AB","blog":"http://joakim.uddholm.com","location":"Stockholm, Sweden","email":"2991072e12edb166327efe7391c0b6af2a8ba316@gmail.com"},"url":"https://github.com/Tethik/Travelling-Salesperson-2D/compare/e89202a342...f33b5bcdf7"}