The transpose of a directed graph GD= (V, E) is the graph G ^T D = (V, E ^T ), where

E ^T = {(v, u) ϵ V × V: (u, v) ϵ E} Thus, G ^T is G with all its edges reversed.

Required:

Describe efficient algorithms for computing G ^T from G, for both the adjacency list and adjacency-matrix representations of G. Analyze the running times of your Algorithms

Answer rating: 100% (QA)

Adjacencylist LISTTRANSPOSE given an array Adj of V lists ... View the full answer