Hopcroft–Karp algorithm: Difference between revisions

Content deleted Content added
Line 33:
for u:U
for v:V such that (u,v) belongs to E
if ((u,v) is not in M)
add (u,v) to M;
break;