In an adjacency list representation of an undirected simple graph G = (V,E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. [G16S2Q51]

Explanation