{"payload":{"header_redesign_enabled":false,"results":[{"id":"103216058","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"nkumar1896/Travelling-Salesman-problem-using-Simulated-Annealing","hl_trunc_description":"Solving the Travelling Salesman Problem (TSP) using Simulated Annealing Algorithm","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":103216058,"name":"Travelling-Salesman-problem-using-Simulated-Annealing","owner_id":26718572,"owner_login":"nkumar1896","updated_at":"2017-09-12T04:01:20.200Z","has_issues":true}},"sponsorable":false,"topics":[],"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":85,"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%253Ankumar1896%252FTravelling-Salesman-problem-using-Simulated-Annealing%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/nkumar1896/Travelling-Salesman-problem-using-Simulated-Annealing/star":{"post":"ZihFe8ZIZAYF0aNtpc72KU0mxKwjw3ES6lYmJo0Sqa4OWz8SHyBLXWlM811CF11XQz8hyI7NvDOtmJjQ0xfFpQ"},"/nkumar1896/Travelling-Salesman-problem-using-Simulated-Annealing/unstar":{"post":"ZdbRb6AVvRVjCXcrdVk_ZaT8bKu-U13zhBxKBXqcidLeenmaTwycN5xudSPrpKT9k4zUAIzgVb51FlKNKHttiA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"Owsf9aOTtsQmnPGYXoQV9eXKLUNgBN88uFL1l9znvyKh1yC1BtzlFjLfIIITXVbod3eq9MDJ_b3Aq2okf-pCuQ"}}},"title":"Repository search results"}