Consider the following statements regarding the graph below, where a DFS algorithm was run, starting at A. Assume the adjacency lists are in alphabetical order.
I. Edge 4 is a forward edge.
II. Edge 11 is the only cross edge.
III. There are 8 tree edges.
Which of the alternatives below is correct?
(A) Only I and II are correct.
(B) Only II and III are correct.
(C) Only I is correct.
(D) Only III is correct.
(E) None of the above.
Original idea by: Raysa Masson Benatti
No comments:
Post a Comment