Can edge list E be omitted from the adjacency matrix representation while still achieving the time bounds given in Table 14.1? Why or why not?

Transcribed Image Text:

Edge List | Adj. List O(1) 0(1) O(n) O(m) O(m) O(m) Adj. Matrix 0(1) 0(1) O(n) O(m) O(1) O(n) Method Adj. Map O(1) O(1) O(n) O(m) 0(1) exp. O(1) numVertices() numEdges() vertices() edges() getEdge(u, v) outDegree(v) inDegree(v) outgoingEdges(v) | 0(m) incomingEdges(v) insertVertex(x) removeVertex(v) insertEdge(u, v, x) | 0(1) removeEdge(e) O(1) 0(1) O(n) O(m) O(min(dµ,d,)) O(1) O(dv) O(n) (^p)O 0(1) O(m) O(n²) O(n2) 0(1) (*p)O 0(1) 0(1) O(1) ("p)0 0(1) exp. 0(1) еxp. (1)0 O(1) O(1)