Revision as of 23:10, 26 June 2008 edit Nitayj (talk \| contribs) 1 edit No edit summary ← Previous edit		Revision as of 04:27, 9 October 2008 edit undo Kathmandu guy (talk \| contribs) 3 edits m A queue is first in first out not last in first out (stack). Next edit →
Line 20: Lets name the two sets in which G can be partitioned as U and V. The matching from U to V at any time is represented as the set M. We also maintain a queue(~~last~~first in first out datastructure) Q in our pseudo code. ''Pseudo Code''

Hopcroft–Karp algorithm: Difference between revisions