diff options
| author | Paul Jungeblut <s_jungeb@i08pc79.atis-stud.uni-karlsruhe.de> | 2014-11-26 11:45:23 +0100 |
|---|---|---|
| committer | Paul Jungeblut <s_jungeb@i08pc79.atis-stud.uni-karlsruhe.de> | 2014-11-26 11:45:23 +0100 |
| commit | 2c133b76f193478bb85d41a76ae78695cc067452 (patch) | |
| tree | 284bb9ac689de206cef7f9fd991a9998cec62f7c /graph | |
| parent | 1a91dadfeed24be8ceda8636795ad776c658bb88 (diff) | |
levenshtein
Diffstat (limited to 'graph')
| -rw-r--r-- | graph/graph.tex | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/graph/graph.tex b/graph/graph.tex index 98d5ffd..4c49663 100644 --- a/graph/graph.tex +++ b/graph/graph.tex @@ -20,6 +20,7 @@ Kürzestes Pfade in Graphen mit negativen Kanten. Erkennt negative Zyklen. \subsubsection{\textsc{Floyd-Warshall}-Algorithmus} Alle kürzesten Pfade im Graphen. \lstinputlisting{graph/floydWarshall.cpp} +\textsc{Floyd-Warshall} findet auch negative Kreise. Es existiert genau dann ein negativer Kreis, wenn \lstinline{dist[i][i] < 0} ist. \subsection{Strongly Connected Components (\textsc{Tarjans}-Algorithmus)} \lstinputlisting{graph/scc.cpp} |