{"payload":{"header_redesign_enabled":false,"results":[{"id":"577124160","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"fabianhr21/Traveling-Sales-Man-Problem","hl_trunc_description":"With this code we try to find the shortest path can be set in a graph of N nodes starting from a node and ending in the same node passing…","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":577124160,"name":"Traveling-Sales-Man-Problem","owner_id":113201512,"owner_login":"fabianhr21","updated_at":"2022-12-12T21:56:55.230Z","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":77,"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%253Afabianhr21%252FTraveling-Sales-Man-Problem%2B%2Blanguage%253APython","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/fabianhr21/Traveling-Sales-Man-Problem/star":{"post":"dfRS_i0z0V1oQrLj9JbdYGmyU999yQFLg0sqzdvzRGQoa166D6YsrBBcC0zLbwy5RpVBdofTy4ei-3ARNsa0cA"},"/fabianhr21/Traveling-Sales-Man-Problem/unstar":{"post":"0A2xiI_3F9mmHVTGNbPc-TY37q0CtEN7HOWJMWa5fEvzjkif-fzhwOSQ37dseQ3AEeGQuwr8BkdMT9sZLigNLw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"JgV1nfp4R_b7MfYCdjeGeLm7JqL_N-r2dL94MMicp25jTKMWyYSeEausbhYoA5F4rRlq99zlrNlvTwDLK2_AYg"}}},"title":"Repository search results"}