diff options
| author | Paul Jungeblut <paul.jungeblut@gmail.com> | 2017-06-19 15:52:34 +0200 |
|---|---|---|
| committer | Paul Jungeblut <paul.jungeblut@gmail.com> | 2017-06-19 15:52:34 +0200 |
| commit | ca41d9ccd8ed00e9efa20bc104e21fc0e49a301d (patch) | |
| tree | 8671a26202e1794cff5195bc6d7ad3cc84e2b7db /graph/graph.tex | |
| parent | 918af529f83833407c8bbcefa262f173ece80b6d (diff) | |
Adding Dinic's algorithm with capacity scaling and numerical integration with adaptive simpson rule.
Diffstat (limited to 'graph/graph.tex')
| -rw-r--r-- | graph/graph.tex | 4 |
1 files changed, 4 insertions, 0 deletions
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 |