From 09debd37df122cbb213f3c7474e33d936b3ce74f Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Fri, 13 Apr 2018 17:26:39 +0300 Subject: [PATCH] Update READMEs. --- src/algorithms/graph/breadth-first-search/README.md | 6 ++++++ 1 file changed, 6 insertions(+) diff --git a/src/algorithms/graph/breadth-first-search/README.md b/src/algorithms/graph/breadth-first-search/README.md index 3fdeda21..d71dc7ec 100644 --- a/src/algorithms/graph/breadth-first-search/README.md +++ b/src/algorithms/graph/breadth-first-search/README.md @@ -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 referred to as a 'search key') and explores the neighbor 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)