diff options
| author | Paul Jungeblut <s_jungeb@i08pc55.atis-stud.uni-karlsruhe.de> | 2014-11-24 14:11:49 +0100 |
|---|---|---|
| committer | Paul Jungeblut <s_jungeb@i08pc55.atis-stud.uni-karlsruhe.de> | 2014-11-24 14:11:49 +0100 |
| commit | 172dcb7d3fbfc93145e1c8a4bbd109539a36990e (patch) | |
| tree | 7a9b43e816affbc18e1991ea1f5a2f51399ae18a /graph/graph.tex | |
| parent | a4d473bfe1d1b77ebc0a6b061d4a126779f48c31 (diff) | |
| parent | 3bf9e44bf552ef5ceef2a4eef87907cc1a8db09b (diff) | |
merge
Diffstat (limited to 'graph/graph.tex')
| -rw-r--r-- | graph/graph.tex | 9 |
1 files changed, 8 insertions, 1 deletions
diff --git a/graph/graph.tex b/graph/graph.tex index fada803..e3fd262 100644 --- a/graph/graph.tex +++ b/graph/graph.tex @@ -1,5 +1,8 @@ \section{Graphen} +\subsection{Lowest Common Ancestor} +\lstinputlisting{graph/LCA.cpp} + \subsection{Kürzeste Wege} \subsubsection{Algorithmus von \textsc{Dijkstra}} @@ -10,6 +13,10 @@ Kürzeste Pfade in Graphen ohne negative Kanten. Kürzestes Pfade in Graphen mit negativen Kanten. Erkennt negative Zyklen. \lstinputlisting{graph/bellmannFord.cpp} +\subsubsection{\textsc{Floyd-Warshall}-Algorithmus} +Alle kürzesten Pfade im Graphen. +\lstinputlisting{graph/floydWarshall.cpp} + \subsection{Strongly Connected Components (\textsc{Tarjans}-Algorithmus)} \lstinputlisting{graph/scc.cpp} @@ -26,4 +33,4 @@ Kürzestes Pfade in Graphen mit negativen Kanten. Erkennt negative Zyklen. \lstinputlisting{graph/euler.cpp} \subsection{Max-Flow (\textsc{Edmonds-Karp}-Algorithmus)} -\lstinputlisting{graph/edmondsKarp.cpp}
\ No newline at end of file +\lstinputlisting{graph/edmondsKarp.cpp} |
