Vidyalelo
Data Structure · Q412

Miscellaneous on Data Structures

Programming · Data Structure · question 412

Q412

What will be the maximum number of rounds required to reach all nodes in the flooding algorithm?

A.
Radius to the graph
B.
Diameter of graph
Answer
C.
1
D.
Distance between two nodes

Answer: Option B

Solution

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