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.
Read More: https://en.wikipedia.org/wiki/Depth-first_search
Read More: https://en.wikipedia.org/wiki/Depth-first_search
Download Notes
Ignou MCA Solved Question Paper
0 comments:
Post a Comment
Let us know your responses and feedback