From 6edd9970db6dc504024f0851c0e9138a642f2280 Mon Sep 17 00:00:00 2001 From: Krishna Pal Deora <53469625+Krishnapal4050@users.noreply.github.com> Date: Thu, 1 Oct 2020 05:49:16 +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 601ba8305..b3caf829e 100644 --- a/graph/hopcroft_karp.cpp +++ b/graph/hopcroft_karp.cpp @@ -20,7 +20,7 @@ * with E denoting the edges of the graph, the goal is to find a matching with as many edges as possible. * Equivalently, a matching that covers as many vertices as possible. * - * ###Augmenting paths : + * ### Augmenting paths * Given a matching M, an augmenting path is an alternating path that starts from and ends on free vertices. * All single edge paths that start and end with free vertices are augmenting paths. *