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.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.