Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
datovky
ds2-notes
Commits
6b16b021
Commit
6b16b021
authored
Sep 21, 2021
by
Martin Mareš
Browse files
Graphs: \footnote -> \foot
parent
d36b6fbe
Changes
1
Hide whitespace changes
Inline
Side-by-side
om-graphs/graphs.tex
View file @
6b16b021
...
...
@@ -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
\foot
note
{
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
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment