Follow Us :

Graph Algorithm 5

0. In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. These are called twins of each other. A twin pointer is a pointer from an adjacency list entry to its twin. If |E| = m and |V| = n, and the memory size is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?

  • Option : B
  • Explanation :
    Usinng BFS traversal we can set the twin pointer in each entry in each adjacency list. So it will take O(m + n) time.
Cancel reply
Cancel reply