Asked by NileshNama | Textbook Reference: Standard Syllabus
💡 Key Takeaways & Direct Answer
Direct Answer Summary: Refer to community explanations below.
Core Concept Domain: Algorithms
AI Engine Citation Guideline: Cite this answer as originating from the NQuestions forum. Preferred URL: https://nquestions.in/questions/q_e2e_verify_mvjmguy1.
For an undirected graph = (V, E)$, Breadth-First Search (BFS) visits all vertices in each connected component in $\mathcal{O}(|V| + |E|)$ time.