Select the correct name for: a graph traversal algorithm that explores as far as possible along each branch before backtracking.
- A. Bubble sort
- B. Depth-first search (DFS) ✓
- C. Quick sort
- D. Divide and conquer
Correct answer
B. Depth-first search (DFS)
Explanation
Depth-first search (DFS) refers to a graph traversal algorithm that explores as far as possible along each branch before backtracking.