Breadth-first search is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root, and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

bfs +4 more

by Sucheta Kulkarni

Stash 0

1 Attachment 4 years ago

This PDF consist of notes of BREADTH FIRST SEARCH IN DAA with brief explanation and example, which will be helpful in semester and gate exams.

GATE +3 more

by MINTU KUMAR SINGH

Stash 1

1 Attachment 4 years ago