Breadth First Search(BFS) - Data Structure - Graphs

Q.  Where can we use Breadth First Search(BFS)?
- Published on 25 Aug 15

a. Binary trees
b. Stacks
c. Graphs
d. Both a and c

ANSWER: Graphs

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 21 Nov 15
    We can use Breadth First Search (BFS) in graph. In this technique, the first process starts from the vertex and then visit all the vertices adjacent to the starting vertex. After that process these adjacent vertices one by one visit their adjacent vertices. This process is continuing till all the vertices are visited.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲