Q. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________

• O(V)
• O(E+V)
• O(E)
• O(V*V)

Submit