Fixed a problem

Author: UgurKap

README.md

@@ -15,6 +15,8 @@ These algorithm implementations can be found on sorts.h file.
 
 ## Graph Traversal Algorithms
 
+Note: These will be made public after homework deadline passes.
+
 1. [Breadth First Search](https://github.com/UgurKap/algorithm-implementations/blob/master/AlgoII/HW1/main.cpp)
 2. [Depth First Search](https://github.com/UgurKap/algorithm-implementations/blob/master/AlgoII/HW1/main.cpp)
 
@@ -29,6 +31,6 @@ These algorithm implementations can be found on sorts.h file.
     Priority queue implementation using minimum heaps.
 
 4. [Graph](https://github.com/UgurKap/algorithm-implementations/blob/master/AlgoII/HW1/main.cpp)  
-    Graph implementation using adjacency list. Same file also has breadth first and depth first search algorithms inside it.
+    Graph implementation using adjacency list. Same file also has breadth first and depth first search algorithms inside it. (Note: Will be made public after homework deadline passes.)