1

Time Complexity of DFS is? (V – number of vertices, E – number of edges)

Correct Answer: o(v + e)

Make the most of this question

This page focuses on one High Performance Computing question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

High Performance Computing MCQ: Time Complexity of DFS is? (V – number of vertices, E – number of edges) | Extra Education