0
$\begingroup$

Can somebody clearly explain me the below problem of finding maximum matching in a bipartite graph?

How the vertices are entered in queue? How they choose augment? Are they choosing augment arbitrarily? What does that upward arrow mark below the queue elements represents?

Example Problem

enter image description here

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.