Breadth First Search Sign Video
Upload On Wed Jul 18 2012 by ASL STEM
Average Rating: No Ratings
Definition
Breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal.
Source: Wikipedia
Other Submissions
No other submissions.
BROWSE
All
> Technology
> Computer Science
> Algorithm Design
> Breadth First Search
* video needed
click here to zoom in