Hopcroft–Karp algorithm: Difference between revisions

Revision as of 07:53, 24 April 2008

Revision as of 16:45, 29 April 2008

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;

Line 88:

Delete the paths;

Start;

== References ==