Commit 6b16b021 authored by Martin Mareš's avatar Martin Mareš
Browse files

Graphs: \footnote -> \foot

parent d36b6fbe
......@@ -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
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment