{"payload":{"header_redesign_enabled":false,"results":[{"id":"474163082","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"ZSchweyk/TravelingSalesman","hl_trunc_description":"Scrapes the web for all distances between all combinations (nC2) of n locations, and outputs the paths with the shortest driving times/di…","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":474163082,"name":"TravelingSalesman","owner_id":89613261,"owner_login":"ZSchweyk","updated_at":"2022-04-03T23:18:19.579Z","has_issues":true}},"sponsorable":false,"topics":["selenium","web-scraping","cities","nodes","costs","shortest-path"],"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":53,"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%253AZSchweyk%252FTravelingSalesman%2B%2Blanguage%253APython","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/ZSchweyk/TravelingSalesman/star":{"post":"dgZVbdYLpEFINvUAHWdG6g7YbNEa02Reo0W5F4UKYQkrrlTNdjQltiabDa8tPr2MZapgrsFQZm6uYdF-4rhqNg"},"/ZSchweyk/TravelingSalesman/unstar":{"post":"GyyiSuu0m1UN9EMrYrLnC-r3wv_t116cjXjqwL3VQvypAgjvRerkZP3tOGLxS5Wg_HemU0V1M_oNOSJZ9ZHimw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"JZzk92QMp-Y5CM_-UT4r0Cqw5CFOD_SwYF8qYjaB_k1pFnFRi0mStZLaFIrtzRJu28zdI698Sv70LCUhbGN7bg"}}},"title":"Repository search results"}