Java Reference
In-Depth Information
Mark C
Process (C, A)
Process (C, B)
Print (C, B) and
call DFS on C
B
Mark A
Process (A, C)
Print (A, C) and
call DFS on C
C
C
A
A
A
Call DFS on A
D
F
F
F
Mark F
Process (F, B)
Process (F, C)
Process (F, D)
Print (F, D) and
call DFS on D
Mark B
Process (B, C)
Process (B, F)
Print (B, F) and
call DFS on F
B
B
B
Mark D
C
C
C
Process (D, C)
Process (D, F)
A
A
A
Pop D
E
F
F
B
B
B
Mark E
Process (E, A)
Process (E, F)
Pop E
C
Process (F, E)
Print (F, E) and
call DFS on E
C
C
Done with F
Pop F
A
A
A
Continue with C
Process (C, E)
Process (C, F)
Pop C
Continue with A
Process (A, E)
Pop A
DFS complete
C
Done with B
Pop B
A
A
Figure11.9
A detailed illustration of the DFS process for the graph of Fig-
ure 11.8(a) starting at Vertex A. The steps leading to each change in the recursion
stack are described.
