Code with Shreya
GATE
Job prep
Subjects
Blog
Videos
Quizzes
PYQ
Compiler
Tools
Back to all quizzes
Advanced · BFS / DFS / Dijkstra
Graph Algorithms
10 questions
Question 1 of 10
Score 0
What is the time complexity of BFS on a graph with V vertices and E edges stored as an adjacency list?
O(V)
O(E)
O(V + E)
O(V × E)
Next question