# Glossary

## Algo: Reverse graph

The reverse of a directed graph $G = (V, E)$ is another directed graph $G^R = (V, E^R )$ on the same vertex set, but with all edges reversed; that is, $E^R = \{(v, u) \colon (u, v) \in E\}$.