solved 3.1.3 getSmallestNode

Projektgruppe_175/src/base/GraphAlgorithm.java

@@ -59,6 +59,29 @@ public abstract class GraphAlgorithm<T> {
      */
     private AlgorithmNode<T> getSmallestNode() {
         // TODO: GraphAlgorithm<T>#getSmallestNode()
+    	if(availableNodes.isEmpty())
+    	{
+    		return null;
+    	}
+    	Iterator<Node<T>> iter = availableNodes.iterator();
+    	Iterator<Node<T>> iterMinElem = iter;
+    	AlgorithmNode<T> MinElem;
+    	AlgorithmNode<T> tempElem;
+    	if(iter.hasNext())
+    	{
+    		MinElem = algorithmNodes.get(iter.next());
+	        while (iter.hasNext())
+	        {
+	        	tempElem = algorithmNodes.get(iter.next());
+	            if(tempElem.value < MinElem.value)
+	            {
+	            	iterMinElem = iter;
+	            	MinElem = tempElem;
+	            }
+	        }
+	        iter.remove();
+	        return MinElem;
+    	}
     	return null;
     }