summaryrefslogtreecommitdiff
path: root/graph/graph.tex
diff options
context:
space:
mode:
authorpjungeblut <paul.jungeblut@gmail.com>2014-11-19 11:03:40 +0100
committerpjungeblut <paul.jungeblut@gmail.com>2014-11-19 11:03:40 +0100
commit50503a5884f005680a28274825bf4c15b53fb0b9 (patch)
tree4821428e1f2674f2516b3e6030d4ea5c61fff2a6 /graph/graph.tex
parent1d7b4ee73eae28b9c0c2d6f865e5bf9470d2ad60 (diff)
parentfee5322fe37cb270a93c1693e2668e53138f192d (diff)
modulares Inverses
Diffstat (limited to 'graph/graph.tex')
-rw-r--r--graph/graph.tex5
1 files changed, 5 insertions, 0 deletions
diff --git a/graph/graph.tex b/graph/graph.tex
index 4646ee3..2bf395c 100644
--- a/graph/graph.tex
+++ b/graph/graph.tex
@@ -2,7 +2,12 @@
\subsection{Kürzeste Wege}
+\subsubsection{Algorithmus von \textsc{Dijkstra}}
+Kürzeste Pfade in Graphen ohne negative Kanten.
+\lstinputlisting{graph/dijkstra.cpp}
+
\subsubsection{\textsc{Bellmann-Ford}-Algorithmus}
+Kürzestes Pfade in Graphen mit negativen Kanten. Erkennt negative Zyklen.
\lstinputlisting{graph/bellmannFord.cpp}
\subsection{Strongly Connected Components (\textsc{Tarjans}-Algorithmus)}