Vidyalelo
Data Structure · Q148

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 148

Q148

Time Complexity of Breadth First Search is? (V - number of vertices, E - number of edges)

A.
O(V + E)
Answer
B.
O(V)
C.
O(E)
D.
O(V*E)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board