Transpose of a graph

Dependencies:

1. Graph

The transpose of a directed graph $G = (V, E)$ is the graph obtained by flipping the direction of every edge of $G$.

The transpose of $G$ is denoted by $G^T$.

Dependency for:

1. Acyclic predecessor graph is union of rooted trees
2. Properties of DFS

Info:

• Depth: 1
• Number of transitive dependencies: 1

Transitive dependencies:

1. Graph