backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-05 19:49:56 +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:48:34 +05:30
committed by GitHub
parent ef72195d0c
commit f1f3df36e0
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

@@ -5,7 +5,7 @@
* The Hopcroft–Karp algorithm is an algorithm that takes as input a bipartite graph
* and produces as output a maximum cardinality matching, it runs in O(E√V) time in worst case.
*
* ###Bipartite graph :
* ### Bipartite graph
* A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint
* and independent sets U and V such that every edge connects a vertex in U to one in V.
* Vertex sets U and V are usually called the parts of the graph.