uva 11159 - maximum independent set in bipartite graph: implemented with
min cut / max flow (connections between V and U with infinite weight).
Alternative can use Hopcroft-Karp