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