What is a Breadth First Search? Give a few of its applications.
- 1 Answers
- 967 Views
- Ciena, I also Faced
- E-Mail Answers
Answer / Shubhangi Srivastava
Breadth First Search (BFS) is a graph traversal algorithm that explores all the nodes at a given depth level before moving on to the next level. It uses a queue for traversal and is used in applications such as finding the shortest path between two vertices in an unweighted graph, determining the connected components of a graph, or finding the minimum spanning tree using Prim's algorithm.
| Is This Answer Correct ? | 0 Yes | 0 No |
Explain the applications of stack?
What is mean by sorting?
How do you clear a stack?
What does a treemap do?
Which is faster hashmap or concurrenthashmap?
Write an algorithm to find middle element in the linked list.
Discuss how to implement queue using stack.
What is the meaning of arraylist?
how to find the number of possible tree in the given tree.
12 Answers Persistent, TCS, Wipro,
What are the major data structures used in the hierarchical data model?
What is array and string?
By Which algorithm, the 8 queens problem is solved?
Windows 
