{"payload":{"header_redesign_enabled":false,"results":[{"id":"172763137","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"ghosalsattam/Finding-minimum-flow-through-network-using-ford-fulkersion","hl_trunc_description":null,"language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":172763137,"name":"Finding-minimum-flow-through-network-using-ford-fulkersion","owner_id":39326440,"owner_login":"ghosalsattam","updated_at":"2019-02-26T18:49:24.676Z","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":92,"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%253Aghosalsattam%252FFinding-minimum-flow-through-network-using-ford-fulkersion%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/ghosalsattam/Finding-minimum-flow-through-network-using-ford-fulkersion/star":{"post":"8HXJz_pe7I585eMArAA_1rSoP0wCuDR-MuurTNquBgonz5cSwIu9PjwBs8z82n0lvw3Z6ScvJq42Q5CSUxRohA"},"/ghosalsattam/Finding-minimum-flow-through-network-using-ford-fulkersion/unstar":{"post":"iLfkl-yVNny10r9wFdZwbnlb1IygC9jS-mSd53eKu0JyEJarzanfwASLWuJ9obm4y09Der6cE3V7pfyTmQwbHg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"GsaMwxfhMZ53EmSav2zHEDDtOM5dYvQ7-5FIg3oS2gXtQdpm3BPwgXY-Qf7O2TbRmula-FAFNYcSp4gb9DX7Kw"}}},"title":"Repository search results"}