What is an advantage of using an adjacency list to represent a graph with n vertices and m edges? The list of neighbours of each vertex is stored contiguously in memory. It is faster to tell if two vertices are connected by an edge in the adjacency list representation than it is with an adjacency matrix. The memory required is just (n + m). Adjacency lists can handle directed graphs, while adjacency matrices cannot.