- Closed all Scanner and Buffered Readers

- Added Some Java Doc

- ReverseString - took space out of between each letter so "Zachary" to
"yrahcaZ" instead of "y r a h c aZ"

- bfs - Trying to repair this class but need to research bfs more

- dfs - Trying to repair this class but need to research dfs more

- Added new Classes
1) OctalToBinary - Not done
2) BinaryToOctal - Not done
3) OctalToDecimal - Not done
4) Graphs

-Added the dataStructure Graphs (Unfinished)

data_structures/Graphs.java

@@ -0,0 +1,32 @@
+
+/**
+ * This class implements the Graph data structure
+ * using the classes Graph and Graphs.
+ * 
+ * @author Zachary Jones
+ *
+ */
+class Graph {
+	
+}
+
+/**
+ * This class is used to test the Graph
+ * class above.
+ * 
+ * @author Zachary Jones
+ *
+ */
+
+public class Graphs {
+	
+	/**
+	 * Main method
+	 * 
+	 * @param args Command line arguments
+	 */
+	public static void main(String args[]) {
+		
+	}
+	
+}

data_structures/heaps/MaxHeap.java

@@ -88,7 +88,6 @@ public class MaxHeap implements Heap {
 			try {
 				throw new EmptyHeapException("Attempt to delete an element from an empty heap");
 			} catch (EmptyHeapException e) {
-				// TODO Auto-generated catch block
 				e.printStackTrace();
 			}
         if ((elementIndex > maxHeap.size()) && (elementIndex <= 0)) throw new IndexOutOfBoundsException("Index out of heap range");

data_structures/heaps/MinHeap.java

@@ -91,7 +91,6 @@ public class MinHeap implements Heap {
 			try {
 				throw new EmptyHeapException("Attempt to delete an element from an empty heap");
 			} catch (EmptyHeapException e) {
-				// TODO Auto-generated catch block
 				e.printStackTrace();
 			}
         if ((elementIndex > minHeap.size()) && (elementIndex <= 0)) throw new IndexOutOfBoundsException("Index out of heap range");