{"payload":{"header_redesign_enabled":false,"results":[{"id":"211472699","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"ndsvw/Min-Cuts-Python","hl_trunc_description":"Calculating Min Cuts (# of cuts to split a graph into 2 connected components) in Python with Karger's algorithm","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":211472699,"name":"Min-Cuts-Python","owner_id":21332313,"owner_login":"ndsvw","updated_at":"2019-09-29T11:18:54.373Z","has_issues":true}},"sponsorable":false,"topics":["graph","mincut","karger"],"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":57,"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%253Andsvw%252FMin-Cuts-Python%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/ndsvw/Min-Cuts-Python/star":{"post":"dksb4PmqpT_pP01OFx8bFVlgcjJ2EiLd19naGxdMeK87DGW8N8Syif_rjMhhvMl827F_o1jl7iBV_rp3JS1C4g"},"/ndsvw/Min-Cuts-Python/unstar":{"post":"yCTgFR2s9_FGdIiVyqdOVzdNCiEVV27hCS6BW7512e_DUhDRoV3iorQM6Tw_PGPXAoyL0PAZ0XMbwzgAzNx-CA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"MbjHqC2wwza4DSxYrZsn-Iq-zk_eELXzjt1prs8M80PrZamS6_H6OLlfo1WJezqC8evm63EfDLqAJg0SEFV8ow"}}},"title":"Repository search results"}