From c44d5d8c3f50ae73c00d6509f0ec1b7ac560b22c Mon Sep 17 00:00:00 2001 From: Krishna Pal Deora <53469625+Krishnapal4050@users.noreply.github.com> Date: Thu, 1 Oct 2020 05:49: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 40c0795fa..857937d75 100644 --- a/graph/hopcroft_karp.cpp +++ b/graph/hopcroft_karp.cpp @@ -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