for graphs with parallel edgesthe adjacency matrix representation must be extended so thatinstead of having [ijstoring pointer to an associated edge (vw)it must store pointer to an incidence collection (vw)which stores all the edges from to since most of the graphs we consider are simplewill not consider this complication here the (simpleadjacency matrix allows us to perform method areadjacent(vwin ( time we achieve this running time by accessing vertices and to determine their respective indices and jand then testing if [ijis null or