File talk:HopcroftKarpExample.png

Hi, Sytelus. Thanks for the illustration; any chance of making it an animation that shows the how the algorithm produces the transitions whose states you have pictured? For example, "Explanation" starts by stating that "The key idea is to add two dummy vertices on each side of the graph: uDummy connecting to it to all unmatched vertices in U and vDummy connecting to all unmatched vertices in V," yet your picture doesn't include such (or if it does, they're not clearly labeled as such). As a result, it is difficult to see (for example): A) why U3 has been singled out by the algorithm after the first iteration, and B) more generally, just how the algorithm produces the states you have pictured. Remember: an algorithm is more than just what states it produces, it is how it produces them. Thanks! — Preceding unsigned comment added by OlyDLG (talk • contribs) 01:25, 22 November 2015 (UTC)