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?

Correct Answer: Breadth First Search
This is the definition of the Breadth First Search. Exploring a node, then it’s neighbors and so on.