{"payload":{"header_redesign_enabled":false,"results":[{"id":"139158253","archived":false,"color":"#DA5B0B","followers":0,"has_funding_file":false,"hl_name":"kanzabatool/TravellingSalesmanProblem","hl_trunc_description":"The Travelling Salesman Problem(TSP) technique is applied on the data set of the Sleeping Giant hiking trail route map consisting of edge…","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":139158253,"name":"TravellingSalesmanProblem","owner_id":33962567,"owner_login":"kanzabatool","updated_at":"2018-06-29T14:33:17.319Z","has_issues":true}},"sponsorable":false,"topics":["network","graph-theory","euler-solutions","shortest-paths","travelling-salesperson-problem"],"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":69,"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%253Akanzabatool%252FTravellingSalesmanProblem%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/kanzabatool/TravellingSalesmanProblem/star":{"post":"vbttoyrtpuqMqKBLhafEY5HAmT4xTA2hTEMH6oQuQkJ1vaO_kqmBg4OtZ6pNloqHwLm2IsP-VWO8inbbk_A1ag"},"/kanzabatool/TravellingSalesmanProblem/unstar":{"post":"Z6IhBRdqkCDwNn9tnFPIHXr5o0CUhYD3QmsLO956ABZiJjPONU49h4HIdUm0MhLRsEADL69UWUvVxE_ocAxSgA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"sFYxXA6BfpZiyHIVhcDy3QniPQummid047EkZ6lTsceACH1TEntefxKp4GP0nHT1WGPKlKJ516SjwhoVQZOFLw"}}},"title":"Repository search results"}