algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2025-07-06 01:15:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add DFS.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2018-04-11 09:55:21 +03:00
parent 7656cfd6ea
commit 62d9747495
1 changed files with 9 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -5,3 +5,12 @@ 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.
## Complexity
* Time: O(|V| + |E|)
* Space: O(|V|)
## References
[Wikipedia](https://en.wikipedia.org/wiki/Depth-first_search)