+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Suppose we represent a graph G having n vertices and m edges with the edge list structure….

1. Suppose we represent a graph G having n vertices and m edges with the edge list structure….

1. Suppose we represent a graph G having n vertices and m edges with the edge list structure. Why, in this case, does the insertVertex method run in O(1) time while the removeVertex method runs in O(m) time?2. Give pseudocode for performing the operation insertEdge(u, v, x) in O(1) time using the adjacency matrix representation.