Depth First Search Sign Video
Upload On Wed Jul 18 2012 by ASL STEM
Average Rating: No Ratings
Definition
Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.
Source: Wikipedia
Other Submissions
No other submissions.
BROWSE
All
> Technology
> Computer Science
> Algorithm Design
> Depth First Search
* video needed
click here to zoom in