WARNING! Read the conditions for the problems in this set very carefully!
Assume for a directed graph with numV vertices and numE edges that a vertex index requires vertB bytes, and a pointer requires pointerB bytes. The graph is unweighted, so the adjacency list does not store any weight information. Calculate the byte requirements for an adjacency list.
ANS
Adjacency list has an array (of size |V|) which points to a list of edges.
Every edge appears once on the list. And for each edge there has to be a vertex ID and a pointer to the next edge.
(V * pointer) + (E * (vertex_index + pointer)) bytes = ANS