If a graph has no cycles, then we say that the graph is acyclic. Note
that the graph defined in Example 5.20.1 is acyclic.
We write (u, v) ∈ E + if there exists a path of length at least 1 that has u as
its origin and v as its destination. The relation E + is transitive closure of the
relation E.