diff options
| author | Paul Jungeblut <s_jungeb@i08pc71.atis-stud.uni-karlsruhe.de> | 2014-11-26 18:34:33 +0100 |
|---|---|---|
| committer | Paul Jungeblut <s_jungeb@i08pc71.atis-stud.uni-karlsruhe.de> | 2014-11-26 18:34:33 +0100 |
| commit | 9cf344075f66a3bd2e404b08b72812356bb3f565 (patch) | |
| tree | e2c2069662997a7cfa22c09f536cf2041ce849b5 /graph | |
| parent | 61677a43deb5b16bcbcc4b12a9a5933258481cad (diff) | |
Feinschliff
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 827892b..d4bf9d5 100644 --- a/graph/graph.tex +++ b/graph/graph.tex @@ -67,7 +67,7 @@ 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{Maximal Cardinatlity Bipartite Mathcing} +\subsection{Maximal Cardinatlity Bipartite Matching}\label{kuhn} \lstinputlisting{graph/maxCarBiMatch.cpp} \subsection{TSP} |