Adjacency List vs Matrix

When the graph is sparse and memory efficiency matters When the graph is dense or you need O(1) edge existence checks When you need to iterate over a node's neighbors quickly Always, because it is simpler to implement