Question :
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?
1. Depth First Search
2. Breadth First Search
3. Trim's algorithm
4. None of the mentioned
Answer :
2 - Breadth First Search
|