Go backward to Transitive Closure Go up to Top Go forward to Example |
Proposition: We define the reachability relation
RG := {<x, y> in G0 x G0: y is reachable from x in G}.
Then, for any directed graph <V, E>, R<V, E> is the reflexive and transitive closure of E on V:
forall V, E: <V, E> is directed graph => R<V, E> = reflexiveV(transitiveV(E)).
Problem reduced to computing the transitive closure of edge relation.