Adjacency List

Tags

comp-sci math

Is a way to [see page 3, store] a graph, where each vertex keeps a linked-list of all the vertices its connected to.

These are more compact and [see page 6, preferable] for sparse graph.

Determining whether there's an edge between two vertices can take up to \( \Omega(|v|) \).