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
(d) Insufficient Information
This question was addressed to me in class test.
This intriguing question comes from Breadth First Search topic in division Graph Search of Data Structures & Algorithms II