Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
NTDEV-byte/DepthFirstSearch
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.