From 6b16b021cff060bfa2f2cd690e6f51ce2601c2df Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Tue, 21 Sep 2021 12:50:14 +0200
Subject: [PATCH] Graphs: \footnote -> \foot

---
 om-graphs/graphs.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/om-graphs/graphs.tex b/om-graphs/graphs.tex
index 410d397..a0be31b 100644
--- a/om-graphs/graphs.tex
+++ b/om-graphs/graphs.tex
@@ -460,7 +460,7 @@ The key part of Dinic's algorithm is to find a \em{blocking flow} in the \em{lev
 A \em{blocking flow} is a flow satisfying the property that every (directed) path from source
 to target contains a saturated edge, i.e. edge where the flow equals the capacity. The
 \em{level graph} contains exactly the vertices and edges which lie on some shortest path
-from~$s$ to~$t$ in the residual network\footnote{Residual network is a network containing
+from~$s$ to~$t$ in the residual network\foot{Residual network is a network containing
 the edges with non-zero residual capacity, that is, difference between capacity and a
 flow. Capacity of each edge in residual network is exactly the residual capacity.}. The
 important property of level graph is that it is acyclic and it can be decomposed into
-- 
GitLab