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?

Question

TuteeHUB · Accepted Answer

Breadth First Search

TuteeHUB · Answer

Depth First Search

TuteeHUB · Answer

Trim‚Äö√Ñ√∂‚àö√ë‚àö¬•s algorithm

TuteeHUB · Answer

None of the mentioned

1.	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
B.	Breadth First Search
C.	Trim‚Äö√Ñ√∂‚àö√ë‚àö¬•s algorithm
D.	None of the mentioned
Answer» B. Breadth First Search

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?

Discussion

No Comment Found

Related MCQs

Reply to Comment