If a graph is dense, the adjacency matrix representation is best, and if a graph is sparse, the adjacency list representation is best.

Question

Quizplus · Accepted Answer

The adjacency matrix representation is more space-efficient for dense graphs because it uses a fixed amount of memory, while the adjacency list representation is more space-efficient for sparse graphs because it only stores the existing edges, thus saving memory.

If a Graph Is Dense, the Adjacency Matrix Representation Is