summaryrefslogtreecommitdiff
path: root/content/graph/graph.tex
diff options
context:
space:
mode:
authormzuenni <michi.zuendorf@gmail.com>2026-08-24 21:08:21 +0200
committermzuenni <michi.zuendorf@gmail.com>2026-08-24 21:08:21 +0200
commitd720779f7039d96f2752a67cb6146a04fc78d062 (patch)
treefcbbea30b8f6be0903b81f721035f064243e3433 /content/graph/graph.tex
parentee4a6e4a85be1811fedad0c188aad00ec322e5d6 (diff)
update flow runtimes
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 7389ce6..c1a4e82 100644
--- a/content/graph/graph.tex
+++ b/content/graph/graph.tex
@@ -232,7 +232,7 @@ Sei $a_{ij}$ die Adjazenzmatrix von $G$ \textcolor{gray}{(mit $a_{ii} = 1$)}, da
\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}
@@ -241,7 +241,7 @@ Sei $a_{ij}$ die Adjazenzmatrix von $G$ \textcolor{gray}{(mit $a_{ii} = 1$)}, da
\subsubsection{Dinic's Algorithm mit Capacity Scaling}
\begin{methods}
- \method{maxFlow}{doppelt so schnell wie Ford Fulkerson}{\abs{V}^2\cdot\abs{E}}
+ \method{maxFlow}{doppelt so schnell wie 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/dinicScaling.cpp}