notes table (ashows the adjacency matrix for the graph given in figure table adjacency matrix for the graph in figure vertice you may observe that the adjacency matrix for an undirected graph is symmetricas the lower and upper triangles are same also all the diagonal elements are zero since we consider graphs without any self loops let us find adjacency matrix for digraph given in figure table adjacency matrix for digraph in figure vertice the total number of ' account for the number of edges in the digraph the number of ' in each row tells the outdegree of the corresponding vertex adjacency list representation in this representationwe store graph as linked structure we store all the vertices in list and then for each vertexwe have linked list of its adjacent vertices let us see it through an example consider the graph given in figure figure the adjacency list representation needs list of all of its nodesi and for each node linked list of its adjacent nodes lovely professional university