Which of the following is a graph traversal technique?
2025
Which of the following is a graph traversal technique?
Answer: A. DFS — Correct answer: DFS. Depth First Search is a standard graph traversal technique. It explores one branch deeply before backtracking to visit other vertices.
- A.
DFS
- B.
Stack
- C.
Heap
- D.
Priority Queue
- E.
None of the above
Attempted by 841 students.
Show answer & explanation
Correct answer: A
Correct answer: DFS.
Depth First Search is a standard graph traversal technique. It explores one branch deeply before backtracking to visit other vertices.
Loading lesson…