From 23e7d5289172e5ed9e7b7cddc2a4bf374a071baa Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Fri, 13 Apr 2018 17:24:40 +0300 Subject: [PATCH] Update READMEs. --- src/algorithms/graph/depth-first-search/README.md | 6 ++++++ 1 file changed, 6 insertions(+) diff --git a/src/algorithms/graph/depth-first-search/README.md b/src/algorithms/graph/depth-first-search/README.md index 84eb9c7b..be3565d1 100644 --- a/src/algorithms/graph/depth-first-search/README.md +++ b/src/algorithms/graph/depth-first-search/README.md @@ -5,3 +5,9 @@ searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible 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)