Question: Suppose we represent a graph G having n vertices with an adjacency matrix. Why, in this case, would inserting an undirected edge in G run
Suppose we represent a graph G having n vertices with an adjacency matrix. Why, in this case, would inserting an undirected edge in G run in O(1) time while inserting a new vertex would take O(n2) time?
Step by Step Solution
3.45 Rating (161 Votes )
There are 3 Steps involved in it
Inserting an edges runs in O1 time since it is simp... View full answer
Get step-by-step solutions from verified subject matter experts
