{"payload":{"header_redesign_enabled":false,"results":[{"id":"453373619","archived":false,"color":"#b07219","followers":0,"has_funding_file":false,"hl_name":"cankobanz/maximum-flow-modelling-on-network-flow-graph","hl_trunc_description":"This is a school project from Data Structures and Algorithms course where network flow graph, Dinic's Algorithm are used effectively. It …","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":453373619,"name":"maximum-flow-modelling-on-network-flow-graph","owner_id":81170575,"owner_login":"cankobanz","updated_at":"2023-05-09T07:55:49.337Z","has_issues":true}},"sponsorable":false,"topics":["algorithms-and-data-structures","max-flow","dinic-algorithm"],"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":88,"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%253Acankobanz%252Fmaximum-flow-modelling-on-network-flow-graph%2B%2Blanguage%253AJava","metadata":null,"csrf_tokens":{"/cankobanz/maximum-flow-modelling-on-network-flow-graph/star":{"post":"LMXxkdMzUVihiAa-X4PaBkWSeMH9XhSEx-94eZZGJn1wXQBnew2U1P6hA_wpVgWbc0nl8VIXrOOhMAaAbcr2JA"},"/cankobanz/maximum-flow-modelling-on-network-flow-graph/unstar":{"post":"l9D8j_8-gCrc4msEGLd3Fl5jFFsBEppsV3pv6bzfli66-wsLH78_GzSFROmgz_ghl7EhQZxqiMWFmeTHnwgC2w"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"ep3ERRMkNtdIpcG13n5ovTYrNxPby5u5nyGbsSg486KcQseO1lbiH5ac_tSX8rjHlUFOAnynftFqXc461d8k2Q"}}},"title":"Repository search results"}