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.
Files
Latest commit
This branch is 331 commits behind trekhleb/javascript-algorithms:master.
depth-first-search
Folders and files
Name | Name | Last commit date | ||
---|---|---|---|---|
parent directory.. | ||||