remove redundant slash

adamant-pwn · adamant-pwn · commit c5a15c96c409 · 2023-12-13T14:10:34.000+01:00
diff --git a/src/graph/hungarian-algorithm.md b/src/graph/hungarian-algorithm.md
@@ -123,7 +123,7 @@ Note that conditions are not mutually exclusive.
 
 ??? info "Proof"
 
-    First, note that any vertex that was reachable before recalculation, still be reachable. Indeed, if some vertex is reachable, then there is some path from reachable vertices to it, starting from the unsaturated vertex of the left part; since for edges of the form $(i,j),\ i\in Z_1,\ j\in Z_2$ the sum $u[i]+v[j]$ does not change, this entire path will be preserved after changing the potential.\
+    First, note that any vertex that was reachable before recalculation, still be reachable. Indeed, if some vertex is reachable, then there is some path from reachable vertices to it, starting from the unsaturated vertex of the left part; since for edges of the form $(i,j),\ i\in Z_1,\ j\in Z_2$ the sum $u[i]+v[j]$ does not change, this entire path will be preserved after changing the potential.
     Secondly, we show that after a recalculation, at least one new vertex will be reachable. This follows by the definition of $\Delta$: the edge $(i,j)$ which $\Delta$ refers to will become rigid, so vertex $j$ will be reachable from vertex $i$.
 
 Due to the last lemma, **no more than $n$ potential recalculations can occur** before an augmenting path is found and the matching cardinality of $M$ is increased.
