{"payload":{"header_redesign_enabled":false,"results":[{"id":"133934206","archived":false,"color":"#f34b7d","followers":1,"has_funding_file":false,"hl_name":"alaattinyilmaz/3-color","hl_trunc_description":"An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL. ","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":133934206,"name":"3-color","owner_id":22120701,"owner_login":"alaattinyilmaz","updated_at":"2018-05-18T09:57:41.560Z","has_issues":true}},"sponsorable":false,"topics":["algorithms","heuristics","algorithm-analysis","greedy-algorithms","nphard","heuristic-algorithm","3-coloring","3-colorability-problem","npcomplete"],"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":56,"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%253Aalaattinyilmaz%252F3-color%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/alaattinyilmaz/3-color/star":{"post":"RWqGNACyZlLF5L6hG3xnaxq8lHqmvxXSiH5bOyBKUwYrBOlTKjxZQijbReHdwXrP3lR-jOJjWMro8R1kericDw"},"/alaattinyilmaz/3-color/unstar":{"post":"qz--nZUnAUhEacC01tV8daogjOCusY06B6ugGp1BS5tUmQkIYXmtCg8lfB7SvKw3wvPumvlBKvj0SIK5GUPrxg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"8nnUDs3lnKWMndPdS0kT_Mze8JWJ04bUUuxePPGoHamN_lPqMGDPpQDeiNQj2GBuGvE3ayxaYL4rZFwaY9dVnw"}}},"title":"Repository search results"}