{"payload":{"header_redesign_enabled":false,"results":[{"id":"148318660","archived":false,"color":"#3572A5","followers":2,"has_funding_file":false,"hl_name":"Maasouza/K-MMSFP","hl_trunc_description":"Heuristics and meta-heuristics for solving the mini-max K-rooted spanning forest problem","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":148318660,"name":"K-MMSFP","owner_id":5924359,"owner_login":"Maasouza","updated_at":"2018-09-18T20:57:13.506Z","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":112,"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%253AMaasouza%252FK-MMSFP%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/Maasouza/K-MMSFP/star":{"post":"KN53ALvOAnokU3iMJblPZ7jisQ24-aymGQW6KUPCQ3d_TFPyV9nFK5yGf1kn2TtRhsJbHrr15kYYsW85oFWDPw"},"/Maasouza/K-MMSFP/unstar":{"post":"BAgDWSIq-jKXyEmU_kMEl9LfEm59XO5tUyI3ay1lLa92DCQUoQCgI9evnEDd-MM-YlSg_8693yy6TzTo0QkYtg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"xe59HnY_v3rfGkcwNBYiRnCE3aGibQ9cxR_calqp4wlW4nqxjIpxieRrmnJDJ5pQJMaNSDnHmMPP0EM5i7DqCQ"}}},"title":"Repository search results"}