From f1f3df36e0e15d8579a56a1457c8cb3fe7822185 Mon Sep 17 00:00:00 2001 From: Krishna Pal Deora <53469625+Krishnapal4050@users.noreply.github.com> Date: Thu, 1 Oct 2020 05:48:34 +0530 Subject: [PATCH] Update graph/hopcroft_karp.cpp Co-authored-by: David Leal --- graph/hopcroft_karp.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/graph/hopcroft_karp.cpp b/graph/hopcroft_karp.cpp index 728f2a2a4..d3a3399ed 100644 --- a/graph/hopcroft_karp.cpp +++ b/graph/hopcroft_karp.cpp @@ -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.