Update READMEs.

This commit is contained in:
Oleksii Trekhleb
2018-04-13 17:24:40 +03:00
parent f26fd87c0a
commit 23e7d52891

View File

@ -5,3 +5,9 @@ searching tree or graph data structures. One starts at
the root (selecting some arbitrary node as the root in the root (selecting some arbitrary node as the root in
the case of a graph) and explores as far as possible the case of a graph) and explores as far as possible
along each branch before backtracking. along each branch before backtracking.
![Algorithm Visualization](https://upload.wikimedia.org/wikipedia/commons/7/7f/Depth-First-Search.gif)
## References
[Wikipedia](https://en.wikipedia.org/wiki/Depth-first_search)