Career Tracks
Exams
MCQ
Companies
Opportunities
Pricing
MCQ Practice
Programming
Time & Space Complexity
Question
Medium
tcs-nqt
What is the time complexity of DFS and BFS on a graph with V vertices and E edges?
A
O(V)
B
O(E)
C
O(V + E)
D
O(V × E)
Show Answer
← Back to Time & Space Complexity questions
What is the time complexity of DFS and BFS on a graph with V vertices and E edges? | Time & Space Complexity MCQ | TomoLink | TomoLink
