BreadthFirstSearch.md (293B)
1 # BFS 2 3 CS 202 L14 4 5 **Definition:** Search algorithm that moves its way outward from the root node. This is different than [DepthFirstSearch](DepthFirstSearch.md) as it does not go all the way down and then search but instead moves away from the root. 6 7 This uses a [Queue](Queue.md) to search.