Which of the following is application of Breath First Search on the graph?
2018
Which of the following is application of Breath First Search on the graph?
- A.
Finding diameter of the graph
- B.
Finding bipartite graph
- C.
Both (a) and (b)
- D.
None of the above
Attempted by 496 students.
Show answer & explanation
Correct answer: C
Breadth-First Search (BFS) is a graph traversal algorithm used to explore nodes layer by layer. Key applications include finding the shortest path in unweighted graphs, determining connectivity between nodes, and web crawling.
A video solution is available for this question — log in and enroll to watch it.