Q96
A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use?
A.
Depth First Search
B.
Breadth First Search
AnswerC.
Trim's algorithm
D.
Kruskal's algorithm
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board