mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-04 19:20:17 +08:00
Update graph/hopcroft_karp.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
committed by
GitHub
parent
df19ec76e9
commit
c44d5d8c3f
@@ -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
|
||||
|
||||
Reference in New Issue
Block a user