WARNING! Read the conditions for the problems in this set very carefully!
Assume for an undirected graph with numV vertices and numE edges that a vertex index requires vertB bytes, a pointer requires pointerB bytes, and that edge weights require edgeB bytes. Since the graph is undirected, each undirected edge is represented by two directed edges. Calculate the byte requirements for an adjacency matrix.
ANS
The matrix is |V| by |V|
The adjacency matrix needs the same amount of space regardless of whether the graph is directed or undirected.
Each position of the matix needs edgeB bytes
V^2 * edge_weight bytes = ANS