summaryrefslogtreecommitdiff
path: root/graph/graph.tex
diff options
context:
space:
mode:
authorPaul Jungeblut <paul.jungeblut@gmail.com>2017-07-29 18:12:01 +0200
committerGitHub <noreply@github.com>2017-07-29 18:12:01 +0200
commitfa200ce752674fbfa464536d315c61fdb98d4be9 (patch)
tree86adde58f7ff8c73d364f92b97899f4e6c03a4b8 /graph/graph.tex
parent7cbca064aefe26f9a4606fbdab938889cb3a182b (diff)
parentdc068beb30a7f257640178dcd00512ed6594a061 (diff)
Merge pull request #28 from mzuenni/master
implemented new bitonic tsp algorithm
Diffstat (limited to 'graph/graph.tex')
-rw-r--r--graph/graph.tex5
1 files changed, 2 insertions, 3 deletions
diff --git a/graph/graph.tex b/graph/graph.tex
index 937b976..596c0d6 100644
--- a/graph/graph.tex
+++ b/graph/graph.tex
@@ -37,7 +37,6 @@ Erkennt negative Zyklen.
\subsection{Strongly Connected Components (\textsc{Tarjans}-Algorithmus)}
\lstinputlisting{graph/scc.cpp}
-% TODO (pjungeblut): This has errors for bridges!
\subsection{Artikulationspunkte und Brücken}
\lstinputlisting{graph/articulationPoints.cpp}
@@ -110,6 +109,6 @@ Nochmal ca. Faktor 2 schneller als Ford Fulkerson mit Capacity Scaling.
% \subsection{TSP}
% \lstinputlisting{graph/TSP.cpp}
-% \subsection{Bitonic TSP}
-% \lstinputlisting{graph/bitonicTSP.cpp}
+\subsection{Bitonic TSP}
+\lstinputlisting{graph/bitonicTSP.cpp}