{"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":1,"fork":false,"size":22130,"owner":"figgefred","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-11-14T06:49:09-08:00","pushed_at":"2013-12-07T16:44:32-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Frederick","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/figgefred/Travelling-Salesperson-2D/compare/c48f632b80...43977dab3e"}