Vidyalelo
Data Structure · Q18

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 18

Q18

What is the space complexity of storing an adjacency matrix for a graph with V vertices?

A.
O(E)
B.
O(V log V)
C.
O(V2)
Answer
D.
O(V + E)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board