{"payload":{"header_redesign_enabled":false,"results":[{"id":"725654467","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"numbersanalyst/traveling-salesman-problem","hl_trunc_description":"A simple heuristic construction for solving the traveling salesman problem (TSP) in Python.","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":725654467,"name":"traveling-salesman-problem","owner_id":124043202,"owner_login":"numbersanalyst","updated_at":"2023-11-30T17:27:31.764Z","has_issues":true}},"sponsorable":false,"topics":["python","tutorial","algorithms","networkx","matplotlib","tsp-solver"],"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":83,"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%253Anumbersanalyst%252Ftraveling-salesman-problem%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/numbersanalyst/traveling-salesman-problem/star":{"post":"5sCr33txhLrfue7PEYyfcM5_a3HrnNI4ETQQe0LT9qDSv2gjViFMkh4lhdfuy284ydMJtYEz3E1Vra5CPxb27Q"},"/numbersanalyst/traveling-salesman-problem/unstar":{"post":"lLztoSoCyAUkdEg3zOQBbdQspTm-HdYnd_pllDEPZycMqT-yzxmb-lbuTkRNoeeiXPpg2DsL7vhfeYgTgJ-FZQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"Fik9dg1opTYLX_XgklkdDyisxI98VbkYoCdfnr_c19OpHp3LUBpmQ_9xBLuOmC_rC7r5Kj0vTRKbYHVugncS6w"}}},"title":"Repository search results"}