{"payload":{"header_redesign_enabled":false,"results":[{"id":"251458839","archived":true,"color":"#DA5B0B","followers":7,"has_funding_file":false,"hl_name":"yammadev/aco-tsp","hl_trunc_description":"Solving Travelling Salesman Problem using Ant Colony Optimization","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":251458839,"name":"aco-tsp","owner_id":12621550,"owner_login":"yammadev","updated_at":"2020-04-04T21:29:00.641Z","has_issues":true}},"sponsorable":false,"topics":["machine-learning","jupyter-notebook","artificial-intelligence","ant-colony-optimization","travelling-salesman-problem","euclidean-distances","aco-tsp"],"type":"Public archive","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":71,"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%253Ayammadev%252Faco-tsp%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/yammadev/aco-tsp/star":{"post":"azBU3ueYeiF9nqHH-pXdNiNyQXZjK02N1A4bBJSIJtHQ4w2oOqkBEFkauDbLldekEuUZfGNT_9DsQEC8_7AULQ"},"/yammadev/aco-tsp/unstar":{"post":"D8jvCTIQzGSo_OjKM9VCq0efffe_MxwA1smOTOowPOh8sKh8Elj6TCt_optznBZx7Dqjsk7GUKUr5a9r_S40ag"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"XtnfDvejq29Xd7eoDFFv16cmW4NE7INm4huccjnUt-C2fWzMlLihCi2P-9brxas_u6FFfIni-LA4l3OE6r4row"}}},"title":"Repository search results"}