diff --git a/doc/Dokumentation.tex b/doc/Dokumentation.tex
index b9e5749..1ede9b5 100644
--- a/doc/Dokumentation.tex
+++ b/doc/Dokumentation.tex
@@ -31,6 +31,22 @@
 		\caption{Bildung von Kanten}\label{euclid}
 		\begin{algorithmic}[1]
 		\Procedure{generateEdges}{}
+		\If{nodes is empty} return 
+		\EndIf
+		\State $castle \gets allCastles[0]$
+		\State $remainingCastles \gets allCastles$
+		\BState \emph{loop:}
+		\If{$remainingCastles$ is empty} break
+		\EndIf
+		\State connect $castle$ to nearest castle
+		\State $castle \gets nearest castle$
+		\State remove $castle$ from $remainingCastles$
+		\BState \emph{end loop}
+		\BState \emph{for each castle in allCastles:}
+		\State \emph{for each nearCastle in allCastlesInRadius(castle):}
+		\State connect $castle$ to $nearCastle$
+		\State \emph{end for each}
+		\BState \emph{end for each}
 		\EndProcedure
 		\end{algorithmic}
 	\end{algorithm}
@@ -114,6 +130,11 @@
 	werden der ArrayDeque \texttt{nextVisitNodes} hinzugefügt.
 
 	\subsection{Wege finden}
+	\subsubsection{Teil (a)}
+
+	\subsubsection{Teil (b)}
+
+	\subsubsection{Teil (c)}
 
 	\subsection{Kürzester Pfad zu allen Knoten}