sec terminology and representations ( ( (cfigure using the graph representations for undirected graphs (aan undirected graph (bthe adjacency matrix for the graph of ( (cthe adjacency list for the graph of (awhich graph representation is more space efficient depends on the number of edges in the graph the adjacency list stores information only for those edges that actually appear in the graphwhile the adjacency matrix requires space for each potential edgewhether it exists or not howeverthe adjacency matrix requires no overhead for pointerswhich can be substantial costespecially if the only information stored for an edge is one bit to indicate its existence as the graph becomes denserthe adjacency matrix becomes relatively more space efficient sparse graphs are likely to have their adjacency list representation be more space efficient example assume that the vertex index requires two bytesa pointer requires four bytesand an edge weight requires two bytes then the adjacency matrix for the graph of figure requires | bytes while the adjacency list requires | | bytes for the graph of figure the adjacency matrix requires the same space as beforewhile the adjacency list requires | | bytes (because there are now edges instead of