Algorithm: Bipartite Graph Matching

二部グラフの最大マッチング

 

output

[(0, 1), (1, 0)]
[(0, 1), (1, 0), (2, 2)]
[(1, 0)]
[(0, 1), (1, 0), (2, 2), (3, 4), (4, 3)]