previous up next
Go backward to Path Properties
Go up to Top
Go forward to Reflexive Closure
RISC-Linz logo

Reachability

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:

y is reachable from x in G : <=>
   exists p: p is path in G /\  p is path from x to y.

We are going to construct the reachability relation from E.


Author: Wolfgang Schreiner
Last Modification: January 26, 2000

previous up next