From d720779f7039d96f2752a67cb6146a04fc78d062 Mon Sep 17 00:00:00 2001 From: mzuenni Date: Mon, 24 Aug 2026 21:08:21 +0200 Subject: update flow runtimes --- content/graph/graph.tex | 4 ++-- tcr.pdf | Bin 702008 -> 702022 bytes 2 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} diff --git a/tcr.pdf b/tcr.pdf index 4e2a150..ca08ac2 100644 Binary files a/tcr.pdf and b/tcr.pdf differ -- cgit v1.2.3