Example (1)

U = {A,B,C,D,E,F}

S = {{A,C,E}, {A,C,F}, {B,D,E}}

F

E

D

C

B

A

Initial PQ tree.

All orderings are

possible. That is,

PQ(T) = all orderings

{A,C,E}

F

E

D

C

B

A

T

F

E

D

C

B

A

Previous slide

Next slide

Back to first slide

View graphic version