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, a pointer requires pointerB bytes, and edge weights require edgeB bytes. Calculate the byte requirements for an adjacency matrix.
ANS
The matrix is |V| by |V|
Each position of the matix needs edgeB bytes
V^2 * edge_weight bytes = ANS