summaryrefslogtreecommitdiff
path: root/graph
diff options
context:
space:
mode:
authorNoobie99 <noob999noob999@gmail.com>2023-08-29 10:19:31 +0200
committerNoobie99 <noob999noob999@gmail.com>2023-08-29 10:19:31 +0200
commit606b5c772b787ab205a37ae1a151f72d5f93f991 (patch)
treedefa89631d94bbc2d24efb20ae37b90d68b53d88 /graph
parent911a19c17730d912f5e64e2b8bcc28980a956b8e (diff)
fix
Diffstat (limited to 'graph')
-rw-r--r--graph/graph.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/graph/graph.tex b/graph/graph.tex
index b090c3f..0249b30 100644
--- a/graph/graph.tex
+++ b/graph/graph.tex
@@ -210,7 +210,7 @@ Sei $a_{ij}$ die Adjazenzmatrix von $G$ \textcolor{gray}{(mit $a_{ii} = 1$)}, da
\method{maxFlow}{gut bei sehr dicht besetzten Graphen.}{\abs{V}^2\*\sqrt{\abs{E}}}
\method{addEdge}{fügt eine \textbf{gerichtete} Kante ein}{1}
\end{methods}
-\sourcecode{graph/pushRelabel3.cpp}
+\sourcecode{graph/pushRelabel2.cpp}
\subsubsection{Dinic's Algorithm mit Capacity Scaling}
\begin{methods}