Update graph/hopcroft_karp.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Krishna Pal Deora
2020-10-01 05:49:34 +05:30
committed by GitHub
parent df19ec76e9
commit c44d5d8c3f

View File

@@ -30,7 +30,7 @@
* i.e, a matching is maximum if no augmenting path exists.
*
*
* ###Algorithm :
* ### Algorithm
* 1) Initialize the Maximal Matching M as empty.
* 2) While there exists an Augmenting Path P
* Remove matching edges of P from M and add not-matching edges of P to M