Alerts
Wishlist
Cart
Sign In
Categories
Current Affairs & GK
Current Affairs
Show All Current Affairs & GK
eBooks
General Aptitude
Arithmetic Aptitude
Data Interpretation
Show All General Aptitude
General Knowledge
Basic General Knowledge
General Science
Show All General Knowledge
Medical Science
Anatomy
Biochemical Engineering
Biochemistry
Biotechnology
Microbiology
Show All Medical Science
Technical
Database
Digital Electronics
Electronics
Networking
Show All Technical
Verbal and Reasoning
Logical Reasoning
Verbal Ability
Verbal Reasoning
Show All Verbal and Reasoning
In a depth-first search, what happens when a node is visited?
Practice Questions
Q1
In a depth-first search, what happens when a node is visited?
It is added to the queue.
It is marked as visited and all its adjacent nodes are explored.
It is removed from the graph.
It is added to the stack.
Questions & Step-by-Step Solutions
In a depth-first search, what happens when a node is visited?
Steps
Concepts
Step 1: Start at the initial node.
Step 2: Mark the current node as visited to keep track of it.
Step 3: Look at all the nodes that are directly connected to the current node (these are called adjacent nodes).
Step 4: For each adjacent node that has not been visited yet, go to that node and repeat the process from Step 2.
No concepts available.
‹
Biology (School & UG)
Chemistry (School & UG)
Civil Engineering
Commerce & Accountancy
Computer Science & IT
Current Affairs & GK
Data Structures & Algorithms
eBooks
Electrical & Electronics Engineering
English (School)
General Aptitude
General Knowledge
General Knowledge & Current Affairs
Languages & Literature
Law & Legal Studies
Major Competitive Exams
Mathematics (School)
Mechanical Engineering
Medical Science
Physics (School & Undergraduate)
Quantitative Aptitude & Reasoning
Social Science (School)
Technical
Verbal and Reasoning
Vocational & Skill Development
›
Soulshift Feedback
×
On a scale of 0–10, how likely are you to recommend
The Soulshift Academy
?
0
1
2
3
4
5
6
7
8
9
10
Not likely
Very likely
✕
↑
