diff options
| author | pjungeblut <paul.jungeblut@gmail.com> | 2014-12-23 15:32:54 +0100 |
|---|---|---|
| committer | pjungeblut <paul.jungeblut@gmail.com> | 2014-12-23 15:32:54 +0100 |
| commit | f5ac7c6a80d70e17775eeab84bde199b47f2930d (patch) | |
| tree | 787423d1bfe289b0b9063f6c6f02b6b936900bbe /graph/graph.tex | |
| parent | db40b585ccbc3b2b125d6ddaa805c8958dd2d073 (diff) | |
min cost max flow
Diffstat (limited to 'graph/graph.tex')
| -rw-r--r-- | graph/graph.tex | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/graph/graph.tex b/graph/graph.tex index d4bf9d5..04bb93e 100644 --- a/graph/graph.tex +++ b/graph/graph.tex @@ -67,6 +67,9 @@ Finde die maximale Anzahl Pfade von $s$ nach $t$, die keinen Knoten teilen. \item Der maximale Fluss entspricht der unterschiedlichen Pfade ohne gemeinsame Knoten. \end{enumerate} +\subsection{Min-Cost-Max-Flow} +\lstinputlisting{graph/minCostMaxFlow.cpp} + \subsection{Maximal Cardinatlity Bipartite Matching}\label{kuhn} \lstinputlisting{graph/maxCarBiMatch.cpp} |