backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-04 19:20:17 +08:00
Code Issues Projects Releases Wiki Activity

Update graph/hopcroft_karp.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Krishna Pal Deora
2020-10-01 05:49:25 +05:30
committed by GitHub
parent 6edd9970db
commit df19ec76e9
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
graph/hopcroft_karp.cpp
View File

@@ -25,7 +25,7 @@
* All single edge paths that start and end with free vertices are augmenting paths.
*
*
* ###Concept :
* ### Concept
* A matching M is not maximum if there exists an augmenting path. It is also true other way,
* i.e, a matching is maximum if no augmenting path exists.
*