Adjacency List Representation: Undirected Graphs

• Adj is an array indexed from 1 to |V|
• Each element Adj[u] is a linked list
• If (u,v) ∈ E then v ∈ Adj[u]
• The sum of the lengths of the Adj[u] = 2|E|