Question

m/forms/d/e/1FAIpQLSeY2USile4iDv2HJ7rGRg64tXl9YNMqD9-NHLcnDcV
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?
O Depth First Search
O Breadth First Search
O Trim's algorithm
0
None of the mentioned​

Answer 1

Answer:

Depth First Search is the algorithm