Question
Why is an adjacency list often efficient for a sparse social network?
Select an option. Your answer will be checked instantly.
Correct Answer: D. It stores mainly the neighbors that actually exist rather than all possible vertex pairs
Explanation:
Sparse graphs contain far fewer edges than possible pairs. Adjacency lists use memory roughly proportional to vertices plus edges rather than the square of vertex count.
Leave a Reply