Which of the following is NOT a graph traversal algorithm?
2024
Which of the following is NOT a graph traversal algorithm?
- A.
Greedy
- B.
Divide and Conquer
- C.
Dynamic Programming
- D.
More than one of the above
- E.
None of the above
Attempted by 569 students.
Show answer & explanation
Correct answer: D
Correct answer: More than one of the above
A graph traversal algorithm systematically visits vertices or edges of a graph. Standard examples are DFS and BFS. The first three listed choices are general problem-solving paradigms, not graph traversal algorithms.
Greedy: a strategy of making locally optimal choices; not a traversal algorithm by itself.
Divide and Conquer: a decomposition paradigm; not a graph traversal method.
Dynamic Programming: an optimization technique using stored subproblem results; not a traversal method.
None of the above: would mean none of the answer choices should be selected. Since “More than one of the above” correctly captures the situation, this option is not correct.
Final answer: More than one of the above.