{"repository":{"watchers":2,"forks":0,"has_downloads":true,"owner":"srusc2012","stargazers":2,"language":"C","has_issues":true,"has_wiki":true,"created_at":"2012-09-23T14:45:36-07:00","fork":false,"size":1392,"open_issues":2,"description":"An implementation of a solver for the Travelling Salesman problem designed for the littlefe architecture. Uses Genetic Algorithm and parallelism.","private":false,"pushed_at":"2012-11-07T12:56:19-08:00"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/srusc2012/sru-littlefe-tsp/issues/4#issuecomment-10167438"}