diff options
| author | Paul Jungeblut <s_jungeb@i08pc75.atis-stud.uni-karlsruhe.de> | 2014-11-18 14:19:42 +0100 |
|---|---|---|
| committer | Paul Jungeblut <s_jungeb@i08pc75.atis-stud.uni-karlsruhe.de> | 2014-11-18 14:19:42 +0100 |
| commit | fee5322fe37cb270a93c1693e2668e53138f192d (patch) | |
| tree | 0118a14e625bc47c7619df8556b9c824bd8b7760 /graph/graph.tex | |
| parent | 8ceb0e35278563a3b315f04fc60fc9086d6c7a8a (diff) | |
dijkstra
Diffstat (limited to 'graph/graph.tex')
| -rw-r--r-- | graph/graph.tex | 5 |
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)} |