Java Reference
In-Depth Information
A
B
C
D
E
A
B
C
D
E
F
G
H
I
J
0
1
2
3
4
5
6
7
8
9
F
G
H
I
J
(A)
0
3
5
2
5
A
C
F
J
D
A
B
C
D
E
F
G
H
I
J
0
1
2
3
4
5
6
7
8
9
B
H
G
I
E
(B)
0
0
5
3
5
2
5
A
F
J
A
B
C
D
E
F
G
H
I
J
0
1
2
3
4
5
6
7
8
9
B
C
G
I
D
H
E
(C)
5
0
0
5
3
5
2
5
F
J
A
B
C
D
E
F
G
H
I
J
0
1
2
3
4
5
6
7
8
9
A
G
I
D
B
C
E
H
(D)
Figure6.7
An example of equivalence processing. (a) Initial configuration for
the ten nodes of the graph in Figure 6.6. The nodes are placed into ten independent
equivalence classes. (b) The result of processing five edges: (A, B), (C, H), (G, F),
(D, E), and (I, F). (c) The result of processing two more edges: (H, A) and (E, G).
(d) The result of processing edge (H, E).