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

Compare commits

base: hxx:f189864f2a54549962a7d7e0262e0c84fd0013f5
Branches Tags
hxx:master
...
compare: hxx:5eaa938670a547e650ce041e5d8722d3d9dca21f
Branches Tags
hxx:master

2 Commits
f189864f2a ... 5eaa938670

Author SHA1 Message Date
BryanChan777
5eaa938670
Merge 0cef5caacb into 2c67b48c21 2024-04-25 08:18:29 +08:00
BryanChan777
0cef5caacb
Update README.md 2019-11-22 15:14:33 -08:00
1 changed files with 1 additions and 5 deletions
Show Stats 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) is an algorithm for traversing or
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.
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.
![Algorithm Visualization](https://upload.wikimedia.org/wikipedia/commons/7/7f/Depth-First-Search.gif)