{"payload":{"header_redesign_enabled":false,"results":[{"id":"322831006","archived":false,"color":"#3D6117","followers":1,"has_funding_file":false,"hl_name":"bhargeymehta/agt-max-matchings","hl_trunc_description":"AGT course project on maximum matching in bipartite and general graphs","language":"TeX","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":322831006,"name":"agt-max-matchings","owner_id":34705433,"owner_login":"bhargeymehta","updated_at":"2020-12-25T11:51:18.016Z","has_issues":true}},"sponsorable":false,"topics":["blossom","hungarian-algorithm","hopcroft-karp","bipartite","maximum-matching","kuhn-munkres","blossom-algorithm","augmenting-path","jack-edmonds","augmenting"],"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":89,"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%253Abhargeymehta%252Fagt-max-matchings%2B%2Blanguage%253ATeX","metadata":null,"csrf_tokens":{"/bhargeymehta/agt-max-matchings/star":{"post":"E_7RUeUOwe5S-pHpQEL2fkdMCyPSiZXoOLQ9sBJBtS5CqSTEPY0s44akEYablQNR4WzMlBQ5y_D4AthHKczLIg"},"/bhargeymehta/agt-max-matchings/unstar":{"post":"R4vPpELaM57XVcLQQWC29GhWBgu8wCd__29uESShrG8ELtZVMGQ56MxpTpgm99KcTFi8YTy9-LXHUuwaaQUBkA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"UHK1sUBSelmD_m2JA697dkGq5MdxW2nqcMu33GiUCRiaqTq--iRzFyvnJFQsxXy2BYDMBgUc3FZ0_mKYCM8n3A"}}},"title":"Repository search results"}