Q156
A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?
A.
Depth First Search
AnswerB.
Breadth First Search
C.
Trim's algorithm
D.
Kruskal's Algorithm
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board