Go backward to Path PropertiesGo up to TopGo forward to Reflexive Closure |

*Definition:*
A node `y` is *reachable* from a node `x` in a
graph `G` if there is a path in `G` from `x` to `y`:

yis reachable fromxinG: <=>existsp:pis path inG/\pis path fromxtoy.

- For fixed
`G`, "is reachable" is a binary relation on`V`. `E`is a binary relation on`V`.

*We are going to construct the reachability relation from E.*

Author: Wolfgang Schreiner

Last Modification: January 26, 2000