Data Structures :: Graphs - Discussion
Home > Data Structures > Graphs > MCQs Questions Discussion
2 / 12
Choose the correct option.
An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?
AO(n)
BO(e)
CO(e+n)
DO(e^2)
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!