Go backward to Transitive Closure Go up to Top Go forward to Composition of Relations

Reachability

Algorithm:

reachability(V, E):

n = |V|

R0 = {<x, x>: x in V}

for (i=0; i < n; i++)

Ri+1 = Ri union (Ri o E)

return Rn

Can compute reachability relation from edge relation.