spacewhereas an adjacency matrix representation uses ( space the edge list structure the edge list structure is possibly the simplestthough not the most efficientrepresentation of graph in this representationa vertex of storing an element is explicitly represented by vertex object all such vertex objects are stored in collection vsuch as an array list or node list if is an array listfor examplethen we naturally think of the vertices as being numbered vertex objects the vertex object for vertex storing element has instance variables fora reference to reference to the position (or entryof the vertex-object in collection the distinguishing feature of the edge list structure is not how it represents verticeshoweverbut the way in which it represents edges in this structurean edge of storing an element is explicitly represented by an edge object the edge objects are stored in collection ewhich would typically be an array list or node list edge objects the edge object for an edge storing element has instance variables fora reference to references to the vertex objects associated with the endpoint vertices of reference to the position (or entryof the edge-object in collection visualizing the edge list structure we illustrate an example of the edge list structure for graph in figure figure (aa graph (bschematic representation of the edge list structure for we visualize the elements stored in the vertex and edge