diff options
| author | Paul Jungeblut <s_jungeb@i08pc54.atis-stud.uni-karlsruhe.de> | 2014-11-25 16:18:32 +0100 |
|---|---|---|
| committer | Paul Jungeblut <s_jungeb@i08pc54.atis-stud.uni-karlsruhe.de> | 2014-11-25 16:18:32 +0100 |
| commit | 32a21e6524d1feb9c6442bf53f19bc14e87f1735 (patch) | |
| tree | 781aebc91b0f1290e720cf15bbfa8bdbe79e5591 /graph | |
| parent | ce929ea18aae0f2b80207bb38a329c824bf29166 (diff) | |
bissl Kombinatorik
Diffstat (limited to 'graph')
| -rw-r--r-- | graph/graph.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/graph/graph.tex b/graph/graph.tex index 8d525f6..98d5ffd 100644 --- a/graph/graph.tex +++ b/graph/graph.tex @@ -66,6 +66,6 @@ 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} -\subsubsection{Maximal Cardinatlity Bipartite Mathcing} +\subsection{Maximal Cardinatlity Bipartite Mathcing} \lstinputlisting{graph/maxCarBiMatch.cpp} |