What is the time complexity of BFS on a graph with V vertices and E edges?

Question

Accepted Answer

(C) O(V+E). Explanation: BFS visits each vertex once and each edge once: O(V+E).