Vidyalelo
Data Structure · Q165

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 165

Q165

Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1)

A.
Can be anything
B.
0
C.
At most 1
Answer
D.
Insufficient Information

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board