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?

🎲 Try a Random Question  |  Total Questions in Quiz: 29  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Data Structure: Graphs — practice the complete quiz, review flashcards, or try a random 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?