# Reverse directed graph

Last edited: 2025-12-05

Reverse directed graph

Suppose we have a directed graph $G = (V,E)$. Define the reverse directed graph as $G^R = (V, E^R)$ where

$$E^R = \{(w,v) \mid (v,w) \in E\}.$$