Set<BipartiteNode<T>> leftClone = new FastSet(U);
Set<BipartiteNode<T>> rightClone = new FastSet(V);
leftClone.removeAll(B1);
rightClone.retainAll(B1);
leftClone.addAll(rightClone);
return leftClone;
}
public Set<Edge<BipartiteNode<T>>> calculateMaxmimumMatching() {