Transitive Closure

Suppose we are representing a graph by a relation Edge(X,Y):

Edge(a,b), Edge (a,c), Edge(b,d), Edge(c,d), Edge(d,e)

a

b

c

d

e

How can I express the query:

Find all nodes reachable from a.

Previous slide

Next slide

Back to first slide

View graphic version