Easy Remember Graphs Multiple 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

A O(V)

B O(E)

C O(V+E)

D O(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).

Learn Graphs → Browse All Questions

More Graphs Questions

What is the difference between a directed and undirected graph?

What property of a graph must hold for topological sort to be possible?

What is the in-degree of a node in a directed graph?

What does an empty result from Kahn's topological sort indicate?

Time complexity of Dijkstra's algorithm with a binary min-heap?