Q44
Which graph representation method is more efficient for sparse graphs?
A.
Incidence matrix
B.
Edge list
C.
Adjacency list
AnswerD.
Adjacency matrix
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board