Add link to Graph Breadth-First-Search visualization.

Author: trekhleb

src/algorithms/graph/breadth-first-search/README.md

@@ -13,3 +13,4 @@ nodes first, before moving to the next level neighbors.
 - [Wikipedia](https://en.wikipedia.org/wiki/Breadth-first_search)
 - [Tree Traversals (Inorder, Preorder and Postorder)](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/)
 - [BFS vs DFS](https://www.geeksforgeeks.org/bfs-vs-dfs-binary-tree/)
+- [BFS Visualization](https://www.cs.usfca.edu/~galles/visualization/BFS.html)