198199200201202203204205206207208
} if (!F.isEmpty()) // Free vertices found, stop at this layer. return F; Q.clear(); for (BipartiteNode<T> q : G) { // By construction, q matched. BipartiteNode<T> p = q.matching; p.layer = q.layer + 1; Q.add(p);