Adjacency List

A data structure that stores the neighbours of node $n_i$ in the $i$th index the the array.

Example

adj = [[], [2], [3, 4], [4], [1]]

If the graph is weighted, we also add weights. If the graph is undirected, we add nodes in both directions.