From ca41d9ccd8ed00e9efa20bc104e21fc0e49a301d Mon Sep 17 00:00:00 2001
From: Paul Jungeblut <paul.jungeblut@gmail.com>
Date: Mon, 19 Jun 2017 15:52:34 +0200
Subject: Adding Dinic's algorithm with capacity scaling and numerical
 integration with adaptive simpson rule.

---
 graph/graph.tex | 4 ++++
 1 file changed, 4 insertions(+)

(limited to 'graph/graph.tex')

diff --git a/graph/graph.tex b/graph/graph.tex
index 3870dc3..7f884fe 100644
--- a/graph/graph.tex
+++ b/graph/graph.tex
@@ -73,6 +73,10 @@ Gut bei dünn besetzten Graphen.
 Gut bei sehr dicht besetzten Graphen.
 \lstinputlisting{graph/pushRelabel.cpp}
 
+\subsubsection{Dinic's Algorithm mit Capacity Scaling}
+Nochmal ca. Faktor 2 schneller als Ford Fulkerson mit Capacity Scaling.
+\lstinputlisting{graph/dinicScaling.cpp}
+
 \subsubsection{Anwendungen}
 \begin{itemize}[nosep]
 	\item \textbf{Maximum Edge Disjoint Paths}\newline
-- 
cgit v1.2.3