##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(4 left 3 right)
Trace an example: vertices in , in , edges . Try matching to , to , then needs to bump someone. DFS finds an augmenting path. matches to . Final matching: size .
Notice how DFS automatically finds augmenting paths when a direct match fails. This is the power of the recursive approach. The algorithm handles complex rematching without explicit path tracking.
