From db6e70ebaffb02dfbb5684f70ff6819e07c4e14f Mon Sep 17 00:00:00 2001 From: joachimschmidt557 Date: Thu, 21 Feb 2019 13:56:04 +0100 Subject: [PATCH] Some little refactoring on 3.1.2 --- Projektgruppe_175/src/base/GraphAlgorithm.java | 3 +-- doc/Dokumentation.tex | 2 ++ 2 files changed, 3 insertions(+), 2 deletions(-) diff --git a/Projektgruppe_175/src/base/GraphAlgorithm.java b/Projektgruppe_175/src/base/GraphAlgorithm.java index f15d811..8ecb149 100644 --- a/Projektgruppe_175/src/base/GraphAlgorithm.java +++ b/Projektgruppe_175/src/base/GraphAlgorithm.java @@ -69,8 +69,8 @@ public abstract class GraphAlgorithm { if (availableNodes.isEmpty()) { return null; } + Iterator> iter = availableNodes.iterator(); - Iterator> iterMinElem = iter; AlgorithmNode MinElem; AlgorithmNode tempElem; @@ -79,7 +79,6 @@ public abstract class GraphAlgorithm { while (iter.hasNext()) { tempElem = algorithmNodes.get(iter.next()); if (tempElem.value < MinElem.value) { - iterMinElem = iter; MinElem = tempElem; } } diff --git a/doc/Dokumentation.tex b/doc/Dokumentation.tex index 1ede9b5..6f31e09 100644 --- a/doc/Dokumentation.tex +++ b/doc/Dokumentation.tex @@ -132,6 +132,8 @@ \subsection{Wege finden} \subsubsection{Teil (a)} + $O(n) = $ + \subsubsection{Teil (b)} \subsubsection{Teil (c)}