Update README.md

Author: JoeKarlsson

README.md

@@ -73,7 +73,7 @@ Using these example methods, you should be able to make the graph above like the
 
 
 ## Breadth-first Search Methods
-`BFS(start)`: Starting at the `node` `start` traverse the graph breadth-first and return an array of the path that is traversed as. For example, in the graph above, `BFS(A)` should return `[A,B,C,D,E,F]`.
+`BFS(start)`: Starting at the `node` `start` traverse the graph breadth-first and return an array of `Strings` that represent the path that is traversed. For example, in the graph above, `BFS(A)` should return `["A", "B", "C", "D", "E", "F"]`.
 
 
 ## Getting Started