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?
Options
A : Depth First Search
B : Breadth First Search
C : Trim’s algorithm
D : Kruskal’s Algorithm
Data Structure Depth First Search more questions
In purification steps of nucleic-acids, phenol is used for _______________________
What is the role of concentrated H2SO4 in the reaction....
In single joist timber floors, the depth of the joists....
What is the formula for the depth and height of....
The full form of DBE is _________
A person wants to visit some places. He starts from....
Which of the following graph traversals closely imitates level order....
A man wants to go different places in the world.....
What is the formula for the depth of armature core?
The only drawback of lightweight concrete is that the ___________
Data Structure Adjacency List more Online Exam Quiz
Data Structure Campus Interviews
Data Structure Circular Linked Lists
Data Structure Coin Change Problem
Data Structure Counting Boolean Parenthesizations
Data Structure Dice Throw Problem
Data Structure Direct Addressing Tables