Graph Theory37 sections · 1633 units
Open in Course

Quiz: BFS Complexity

Knowledge check

Check Your Understanding

You run BFS on a graph with VV vertices and EE edges stored as an adjacency list. What is the time complexity?

  1. A.O(V)O(V)
  2. B.O(E)O(E)
  3. C.O(V+E)O(V + E)
  4. D.O(V×E)O(V \times E)
Start the roadmap to answer the quizzes and solve the challenges