hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
BryanChan777 2019-11-22 15:14:33 -08:00 committed by GitHub
parent dc1047df72
commit 0cef5caacb
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/algorithms/graph/depth-first-search/README.md
View File

@ -1,10 +1,6 @@
# Depth-First Search (DFS) # Depth-First Search (DFS)
Depth-first search (DFS) is an algorithm for traversing or Depth-first search (DFS) is an algorithm for traversing graph data structures. The search starts at the tree root or some arbitrary node of a graph. The search explores a branch of nodes until reaching a terminal node before backtracking to explore another branch of nodes.
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) ![Algorithm Visualization](https://upload.wikimedia.org/wikipedia/commons/7/7f/Depth-First-Search.gif)