Final answer:
An adjacency list represents a graph as an array of linked lists. Each element in the array represents a vertex, and the linked list associated with each vertex contains the adjacent vertices.
Step-by-step explanation:
An adjacency list is a data structure used to represent a graph. It consists of an array of linked lists. Each element in the array represents a vertex, and the linked list associated with each vertex contains the vertices that are adjacent to it, i.e., the vertices that form an edge with it.