What is the time complexity of the adjacency list data structure in terms of accessing neighboring vertices in a graph?

The time complexity of accessing neighboring vertices in a graph using an adjacency list data structure is O(1) on average, and O(V) in the worst case scenario, where V is the number of vertices in the graph.