Update READMEs.

This commit is contained in:
Oleksii Trekhleb
2018-04-13 17:26:39 +03:00
parent 23e7d52891
commit 09debd37df

View File

@ -5,3 +5,9 @@ or searching tree or graph data structures. It starts at
the tree root (or some arbitrary node of a graph, sometimes the tree root (or some arbitrary node of a graph, sometimes
referred to as a 'search key') and explores the neighbor referred to as a 'search key') and explores the neighbor
nodes first, before moving to the next level neighbors. nodes first, before moving to the next level neighbors.
![Algorithm Visualization](https://upload.wikimedia.org/wikipedia/commons/5/5d/Breadth-First-Search-Algorithm.gif)
## References
[Wikipedia](https://en.wikipedia.org/wiki/Breadth-first_search)