the edge object for an edge with end vertices and holds references to the positions (or entriesassociated with edge in the incidence collections ( )and (wtraditionallythe incidence collection (vfor vertex is listwhich is why we call this way of representing graph the adjacency list structure the adjacency list structure provides direct access both from the edges to the vertices and from the vertices to their incident edges we illustrate the adjacency list structure of graph in figure figure (aa graph (bschematic representation of the adjacency list structure of as in figure we visualize the elements of collections with names performance of the adjacency list structure