Question

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 Sharch
O
O
Breadth First Search
O
O
Trim's algorithm
O None of the mentioned​

Answer 1

Answer:

Depth First Sharch

Explanation:

hope it's helps you