{"ref":null,"ref_type":"repository","master_branch":"master","description":"This is a solution of a bipartite matching, max flow problem written in Java using the Ford Fulkerson algorithm","pusher_type":"user"}