Files
javascript-algorithms/src/algorithms/graph/depth-first-search
Oleksii Trekhleb 97f8bd3a9f Add DFS.
2018-05-04 16:56:06 +03:00
..
2018-05-04 16:56:06 +03:00
2018-05-04 16:56:06 +03:00
2018-04-25 17:41:21 +03:00

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.

Algorithm Visualization

References