Vidyalelo
Data Structure · Q31

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 31

Q31

Which of the following is true about the BFS algorithm in terms of shortest path?

A.
BFS does not guarantee the shortest path.
B.
BFS always finds the shortest path in an unweighted graph.
Answer
C.
BFS requires a sorted graph.
D.
BFS does not guarantee the shortest path.

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Graph Algorithms (DFS, BFS, Dijkstras, etc) questions