Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Data Structures
Graphs
Question
Medium
What is the time complexity of 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 Graphs questions
What is the time complexity of BFS on a graph with V vertices and E edges? | Graphs MCQ | TomoLink | TomoLink
