Traversal Graph AlgorithmExample 2

s1

q1

q2

q3

t1

A

B

C

D

D

s2

q6

q7

t2

A

C

D

any

any

from A via C to D

s1,s2

q1,q6

q2,q6

q3,q7

t1,t2

A

B

C

D

A=B D.

B=C.

C=D.

D=[A].

A

t1,q7

D

Traversal Graph, after some simplification

can be further simplified by merging (t1,t2) and (t1,q7)

A

Previous slide

Next slide

Back to first slide

View graphic version