Consider the following directed graph
Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier in the alphabetical order is to be chosen. Suppose the number of tree edges is T, the number of back edges is B and the number of cross edges is C. Then
| |
|
| |
(A) B = 1, C = 1, and T = 4.
|
| |
(B) B = 0, C = 2, and T = 4.
|
| |
(C) B = 2, C = 1, and T = 3.
|
| |
(D) B = 1, C = 2, and T = 3.
|
