Consider the following networks:
Consider the graph on the figure below. Determine the number of back edges, cross edges, and forward edges generated by the Depth-First Search (DFS) algorithm. Assume the algorithm visits neighboring vertices in ascending order. A) 2 back edges, 4 cross edges, and 2 forward edges. B) 2 back edges, 5 cross edges, and 1 forward edge. C) 1 back edge, 4 cross edges, and 2 forward edges. D) 1 back edge, 5 cross edges, and 2 forward edges. E) None of the above. Original idea by: Melissa Araújo.

Good question. I took it. Notice that, in English, in a list a, b, and c, a comma precedes the word "and". This is different in Portuguese.
ResponderExcluirGood to know! Thank you
Excluir