adjacency multi-list representation graphs can also be represented using multi-lists which can be said to be modified version of adjacency lists adjacency multi-list is an edge-based rather than vertex-based representation of graphs multi-list representation basically consists of two parts-- directory of nodesinformation and set of linked lists storing information about edges while there is single entry for each node in the node directoryevery nodeon the other handappears in two adjacency lists (one for the node at each end of the edgefor examplethe directory entry for node points to the adjacency list for node this means that the nodes are shared among several lists in multi-list representationthe information about an edge (vivjof an undirected graph can be stored using the following attributesma single bit field to indicate whether the edge has been examined or not via vertex in the graph that is connected to vertex vj by an edge vja vertex in the graph that is connected to vertex vi by an edge for via link that points to another node that has an edge incident on vi link link for via link that points to another node that has an edge incident on vj figure undirected consider the undirected graph given in fig graph the adjacency multi-list for the graph can be given asedge edge edge edge null edge edge null edge edge null edge edge null edge edge edge null edge null null using the adjacency multi-list given abovethe adjacency list for vertices can be constructed as shown belowvertex list of edges edge edge edge edge edge edge edge edge edge edge edge edge edge edge