{"payload":{"header_redesign_enabled":false,"results":[{"id":"620903824","archived":false,"color":"#701516","followers":0,"has_funding_file":false,"hl_name":"KenEzekiel/Branch-and-Bound-TSP","hl_trunc_description":"Algorithm Strategies Project, a Branch-and-Bound Algorithm to solve the TSP using the reduced cost matrix approach, made using Ruby","language":"Ruby","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":620903824,"name":"Branch-and-Bound-TSP","owner_id":88850771,"owner_login":"KenEzekiel","updated_at":"2023-03-30T13:01:23.113Z","has_issues":true}},"sponsorable":false,"topics":["ruby","algorithms","tsp","branch-and-bound","travelling-salesman-problem","algorithm-strategies"],"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":72,"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%253AKenEzekiel%252FBranch-and-Bound-TSP%2B%2Blanguage%253ARuby","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/KenEzekiel/Branch-and-Bound-TSP/star":{"post":"fUL2IWI6kY1WaS5mfFBck6ewj9g6Jn7Kgn7TcriOuZbrzIS5p2heZfc8ts0AZg6Ve51UQbHp7xJf7KJ86ZgZ1w"},"/KenEzekiel/Branch-and-Bound-TSP/unstar":{"post":"k7e9lUC_hmblGZVLh5sjWekdcv8REeRJI7FuGTpOLaZtfwk_BeC97_9DV_0JoiUw8HggSZmZE2Z_8xw7fLSMUg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"WKctH8xrL5el0xMbIUn80PMAQSham2-bkhzl-rWjoG9iwL8jP3_h0Rqv1WHarwa_LRiwBNlqlfglX0cgzGQeMQ"}}},"title":"Repository search results"}