Closure Algorithm

Start with Closure=A.

Until closure doesn’t change do:

if is in C, and

B is not in Closure

then

add B to closure.

A , A , … A

1

2

n

B

A , A , … A

1

2

n

are all in the closure, and

Previous slide

Next slide

Back to first slide

View graphic version