CodeMosa
Master LeetCode Patterns
All Patterns
Collections
Sign In
Back
Graphs
Question 1 of 9
11% Complete
Easy
Which representation uses O(V+E) space and is efficient for sparse graphs?
A
Adjacency list
B
Adjacency matrix
C
Incidence matrix
D
Edge matrix