+1 vote
in Data Structures & Algorithms I by (88.2k points)
In which case adjacency list is preferred in front of an adjacency matrix?

(a) Dense graph

(b) Sparse graph

(c) Adjacency list is always preferred

(d) Complete graph

This interesting question is from Adjacency List in division Graph of Data Structures & Algorithms I

The question was asked in class test.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right answer is (b) Sparse graph

Easy explanation - In case of sparse graph most of the entries in the adjacency matrix would be 0, hence adjacency list would be preferred.

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.