From fee5322fe37cb270a93c1693e2668e53138f192d Mon Sep 17 00:00:00 2001
From: Paul Jungeblut <s_jungeb@i08pc75.atis-stud.uni-karlsruhe.de>
Date: Tue, 18 Nov 2014 14:19:42 +0100
Subject: dijkstra

---
 graph/graph.tex | 5 +++++
 1 file changed, 5 insertions(+)

(limited to 'graph/graph.tex')

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)}
-- 
cgit v1.2.3

