Multiple ChoiceIntermediate 30s
Adjacency List
An adjacency list representation of a graph:
Options
- 1Stores every vertex inside a single flat array indexed by position
- 2Only works correctly for directed graph variants, not undirected
- 3Uses O(V²) space exactly like a dense 2D adjacency matrix
- 4Uses O(V+E) space and is the most common representation
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.