EasyRememberGraphsMultiple Choice
What is the time complexity of BFS on a graph with V vertices and E edges?
Remember — Tests recall of fundamental facts and definitions.
Answer Options
AO(V)
BO(E)
CO(V+E)
DO(V*E)
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 33+ more Graphs questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Graphs topic (Algorithms).
More Graphs Questions
What is the difference between a directed and undirected graph?
EasyWhat property of a graph must hold for topological sort to be possible?
EasyWhat is the in-degree of a node in a directed graph?
EasyWhat does an empty result from Kahn's topological sort indicate?
Medium-EasyTime complexity of Dijkstra's algorithm with a binary min-heap?
Medium-Easy