{"payload":{"header_redesign_enabled":false,"results":[{"id":"88350399","archived":false,"color":"#b07219","followers":9,"has_funding_file":false,"hl_name":"SleekPanther/bipartite-matching","hl_trunc_description":"Application of Ford-Fulkerson algorithm to find the maximum matching between 2 sides of a bipartite graph","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":88350399,"name":"bipartite-matching","owner_id":15304528,"owner_login":"SleekPanther","updated_at":"2017-04-21T11:14:57.118Z","has_issues":true}},"sponsorable":false,"topics":["algorithm","graph","match","directed-graphs","flow-network","maxflow","directed-edges","bipartite-network","cardinality","ford-fulkerson","bipartite-graphs","capacity","flow-networks","maximum-matching"],"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":75,"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%253ASleekPanther%252Fbipartite-matching%2B%2Blanguage%253AJava","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/SleekPanther/bipartite-matching/star":{"post":"raTzf3V1AUOuR5iGbVTE8Gvh2YOV9pR17JBjDp858GPLB-CW6cK_ma7111HyPIVFwCfBSFzslQWFBnkXx-hLZg"},"/SleekPanther/bipartite-matching/unstar":{"post":"cquCT1q-E8s-M19m4n7bVeHSZpMqtZIKpQfyw_uNmrCa7C8qk2s6VKIiKdP0iIoNN7-B2yg7siEcpDnKBu4G1g"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"UEDbjn0mHMjJDJHAf2ZZ4t7TgP9KbJP1Z8tORbRRZ9E18YDwWBUlWrvU3a8bXEfWWhM15UYbGwNAco5Kxn0yNw"}}},"title":"Repository search results"}