Question: 11. Consider a graph G = (V, E) representing a social network such as Facebook or (nowadays) LinkedIn. Let V be the set of users,

11. Consider a graph G = (V, E) representing a social network such as Facebook or (nowadays) LinkedIn. Let V be the set of users, and let (u, v} E E if u, v E V and users u and v are friends/connected on the social network represented by G. Assuming that the most common operation (in regards to G) is to check if two users are connected, would it be better if G were represented by an adjacency matrix? Or by an adjacency list? Justify your answer. %3D 12. Assume the graph G from the previous problem is used in this problem as well, and assume that G is represented by an adjacency matrix. Suppose we wished to list out the mutual connections of two users. What would be the worst-case time complexity of this operation
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
