summaryrefslogtreecommitdiff
path: root/graph/graph.tex
diff options
context:
space:
mode:
authorPaul Jungeblut <s_jungeb@i08pc56.atis-stud.uni-karlsruhe.de>2014-11-25 12:00:30 +0100
committerPaul Jungeblut <s_jungeb@i08pc56.atis-stud.uni-karlsruhe.de>2014-11-25 12:00:30 +0100
commit8f0cbc24424420b9ab0149429272c18e0a66c10a (patch)
tree0ed66cb9f3876a72a8ddfd29a6c7f1303073cebb /graph/graph.tex
parent7113e0921ad8c1592280ffee9445fab29e66fb7f (diff)
bipartites matching
Diffstat (limited to 'graph/graph.tex')
-rw-r--r--graph/graph.tex3
1 files changed, 3 insertions, 0 deletions
diff --git a/graph/graph.tex b/graph/graph.tex
index 79404d4..8d525f6 100644
--- a/graph/graph.tex
+++ b/graph/graph.tex
@@ -66,3 +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}
+\lstinputlisting{graph/maxCarBiMatch.cpp}
+