{"payload":{"header_redesign_enabled":false,"results":[{"id":"2567389","archived":false,"color":"#f34b7d","followers":27,"has_funding_file":false,"hl_name":"ildoonet/simulated-annealing-for-tsp","hl_trunc_description":"This code is to solve traveling salesman problem by using simulated annealing meta heuristic.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":2567389,"name":"simulated-annealing-for-tsp","owner_id":1115758,"owner_login":"ildoonet","updated_at":"2018-01-11T00:49:37.793Z","has_issues":true}},"sponsorable":false,"topics":["python","c-plus-plus","optimization","tsp","heuristic-algorithm","metaheuristics","traveling-salesman-problem","tsplib","simulated-annealing-algorithm"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":95,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Aildoonet%252Fsimulated-annealing-for-tsp%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/ildoonet/simulated-annealing-for-tsp/star":{"post":"ePgYdfC2MGuh51tcIuFED3pjcvc6M2Mi7DURw0u4ASXWwpzIfZa-Dkoje1NKgc6gZb2WsDBD8ndjQBpW8Mqxew"},"/ildoonet/simulated-annealing-for-tsp/unstar":{"post":"4b0w-_gVtgQmfhRccD_s7yKXFFZ2teX5ook_R18A-aOwRamHJVaWUFe90FQp9mGwWB4bBjYEQPN2hsRa11dK8Q"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"E2SKudDlu9RM81f_l3THKIet2luNsNDTZezDU1tcErFMrI5LiFYmBgiVrd8_AdxfmtcuYgUTifFz1S5P0XpLnw"}}},"title":"Repository search results"}