The reverse of a directed graph G = (V, E) is another directed graph GR = (V. ER) on the same vertex set, but with all edges reversed; that is, ER = {(v, u) : (u. v) ∈ E}.
Give a linear-time algorithm for computing the reverse of a graph in adjacency list format.

Answer rating: 100% (QA)

Consider the directed graph G V E The lineartime algorithm to reverse the graph in adjacency list fo... View the full answer