made the readme more clear about the expected outcomes for each algor…

…ithm
devleague · Nov 15, 2016 · d4c88ef · d4c88ef
1 parent 563d4f7
commit d4c88ef
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/README.md b/README.md
@@ -74,7  74,7 @@ The basic operations provided by a Depth-first Search usually include:
 
 
 ## Breadth-first Search Methods
-1. `BFS(start, searchFor)`: Starting at the node `start` traverse the graph breadth-first and return an array of the shortest path between `start` and the node `searchFor`. If there are no matches, return `false`.
 1. `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`.
 
 ### Stretch Goals
 1. Write a blog post ELI5 the differences between depth and breadth-first Search.