{"payload":{"header_redesign_enabled":false,"results":[{"id":"86923933","archived":false,"color":"#b07219","followers":5,"has_funding_file":false,"hl_name":"SleekPanther/ford-fulkerson","hl_trunc_description":"Max Flow / Min Cut Problem using Ford-Fulkerson Algorithm","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":86923933,"name":"ford-fulkerson","owner_id":15304528,"owner_login":"SleekPanther","updated_at":"2017-04-08T14:15:23.839Z","has_issues":true}},"sponsorable":false,"topics":["flow","graph","flow-network","maxflow","ford","fulkerson","ford-fulkerson","max-flow","min-cut","maximum-flow","augmentation-path","flow-networks","flow-assignments"],"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%253ASleekPanther%252Fford-fulkerson%2B%2Blanguage%253AJava","metadata":null,"csrf_tokens":{"/SleekPanther/ford-fulkerson/star":{"post":"uquvGStjJ6mKg7hZ-nBG5I9eSTC1N3VVL1P9hF84pP6m9pC6gvA8YkyRWgKIWIwgtyjZHNFl3cuM_s3l6mnyJw"},"/SleekPanther/ford-fulkerson/unstar":{"post":"yUFQkqPzAQAoIN7EUFamKvNKfzXsmetMzfKDqj4L1UAFSgJdhcQHd--I8UCl5iBvAsKgLczuR2lO3mm_At9E0g"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"eOZ96tBhvtCAma2odaEaaMZLLaqVcuSyIp15VdtjtC_lX-cDkagUboCndAnxgTlwoQc5rAS5MY5kR0cONC4LRQ"}}},"title":"Repository search results"}