学习hopcroft-karp算法时看到这样一段对增广路的证明,想到之前学习匈牙利算法的时候也纠结过一阵子对增广路的证明,后来就不了了之。现在看到了,特意附上笔记。
先上原文,节选自hopcroft-karp的wiki解释:(https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm)
If {\displaystyle M} is a matching, and {\displaystyle P}
is an augmenting path relative to {\displaystyle M}
, then the symmetric difference of the two sets of edges, {\displaystyle M\oplus P}
, would form a matching with size