What is the adjacency list representation of a directed graph?

In a directed graph, the adjacency list representation is a data structure that stores each vertex and its outgoing edges in a list. Each vertex is associated with a list of its neighboring vertices that it has an edge pointing towards. This representation is commonly used to efficiently store and retrieve information about the connections between vertices in a directed graph.