Q91
Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is . . . . . . . .
A.
O(E)
B.
O(V*V)
C.
O(E+V)
AnswerD.
O(V)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board