Reverse directed graph
maths
Reverse directed graph
Suppose we have a directed graph $G = (V,E)$. Define the reverse directed graph to $G^R = (V, E^R)$ where
$$E^R = \{(w,v) \ \vert \ (v,w) \in E\}.$$Suppose we have a directed graph $G = (V,E)$. Define the reverse directed graph to $G^R = (V, E^R)$ where
$$E^R = \{(w,v) \ \vert \ (v,w) \in E\}.$$