1. Give pseudo-code for performing the operation insert edge(u,v,x)in O(1) time using the adjacency matrix representation. 2. Can edge list E be omitted from the adjacency matrix representation while...

1. Give pseudo-code for performing the operation insert edge(u,v,x)in O(1) time using the adjacency matrix representation.

2. 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?

May 26, 2022