Hopcroft–Karp algorithm: Difference between revisions

Content deleted Content added
Line 106:
if (odd)
// Make (t,q) match (first, third, ... edges)
pt.matching := q; <-- this looks wrong probably t.matching := q
q.matching := t;
odd := false;
else
// t.matching has already been updated by the ''odd'' condition
q.matching := null; // This is not strictly required since it will be updated in the next iteration when odd becomes true
odd := true;
end if