+1 vote
in Data Structures & Algorithms I by (88.2k points)
For some sparse graph an adjacency list is more space efficient against an adjacency matrix.

(a) True

(b) False

Enquiry is from Adjacency List topic in portion Graph of Data Structures & Algorithms I

I got this question in my homework.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right option is (a) True

Easiest explanation - Space complexity for adjacency matrix is always O(V*V) while space complexity for adjacency list in this case would be O(V).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.