ordering

G F E D C B A

(a) Ordered graph to be processed (from Figure 3.5)

nodes order: (G,F,E,D,C,B,A), process order: (A,B,C,D,E,F,G)

G F E D C B A

(b) Node A is processed, and edge (F, B) is added

G F E D C B A

(c) Node B is processed, and edges (G, C) and (F, C) are added

G F E D C B A

(d) Node C is processed, and edge (F, D) is added

G F E D C B A

(e) Node D is processed, and edge (G, E) is added

Figure 4.3 Example showing the change of a graph during adaptive-

consistency achievement (Processing of E, F and G add no more edges,
and therefore the graph shown in (e) is the induced graph. Its width
is 3)