Go backward to Transitive ClosureGo up to TopGo forward to Example |

*Proposition:*
We define the reachability relation

R_{G}:= {<x,y> inG_{0}xG_{0}:yis reachable fromxinG}.

Then, for any directed graph <`V`, `E`>,
`R`_{<V, E>} is
the reflexive and transitive closure of `E` on `V`:

forallV,E: <V,E> is directed graph =>R_{<V, E>}= reflexive_{V}(transitive)._{V}(E)

*Problem reduced to computing the transitive closure of edge relation.*

Author: Wolfgang Schreiner

Last Modification: January 26, 2000