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. - Study24x7
Social learning Network
19 Mar 2019 11:57 AM study24x7 study24x7

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 po...

See more

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles