Analyze the statements below, knowing that DFS and BFS algorithms start at node "a" and the adjacency lists are sorted in alphabetical order.
I. During the BFS execution, three nodes that are already visited are verified (thus not being visited again);
II. There is just one back edge in the graph;
III. If we remove edges cd and ef, the resulting graph is a bipartite graph;
IV. The DFS execution would restart twice in this graph, creating two different trees;
The correct statements are:
a) I and III
b) Only II
c) II and III
d) I, II and IV
e) None of the above
Original idea by: Giorgio Rossa
No comments:
Post a Comment