summaryrefslogtreecommitdiff
path: root/content/graph/graph.tex
diff options
context:
space:
mode:
Diffstat (limited to 'content/graph/graph.tex')
-rw-r--r--content/graph/graph.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/content/graph/graph.tex b/content/graph/graph.tex
index b27db0b..040cf3b 100644
--- a/content/graph/graph.tex
+++ b/content/graph/graph.tex
@@ -248,14 +248,14 @@ Sei $a_{ij}$ die Adjazenzmatrix von $G$ \textcolor{gray}{(mit $a_{ii} = 1$)}, da
\subsubsection{\textsc{Dinitz}'s Algorithm mit Capacity Scaling}
\begin{methods}
- \method{maxFlow}{doppelt so schnell wie \textsc{Ford-Fulkerson}}{\abs{V}^2\cdot\abs{E}}
+ \method{maxFlow}{doppelt so schnell wie \textsc{Ford-Fulkerson}}{\min(\abs{V}^2\cdot\abs{E}, F\cdot\abs{E})}
\method{addEdge}{fügt eine \textbf{gerichtete} Kante ein}{1}
\end{methods}
\sourcecode{graph/dinitzScaling.cpp}
\begin{algorithm}{Min-Cost-Max-Flow}
\begin{methods}
- \method{mincostflow}{berechnet Fluss}{\abs{V}^2\cdot\abs{E}^2}
+ \method{mincostflow}{berechnet Fluss}{F\cdot\abs{V}\cdot\abs{E}}
\end{methods}
\sourcecode{graph/minCostMaxFlow.cpp}
\end{algorithm}