Hopcroft–Karp algorithm: Difference between revisions

Revision as of 18:51, 18 June 2008

Revision as of 23:10, 26 June 2008

Line 42:

for all u:U not in M

if (u.flag_inserted != true)

insert u in Q;

u.flag_inserted = true;