Mock DFS Q
Consider DFS over undirected graph with 4 vertices <A;B;C;D>. The discovery and finishing times of them in the order A to D are given. Select the option from following showing more than one connected components: 1) <(1,6), (2,5), (3,4), (8,10)> 2) <(6,7), (2,5), (3,4), (8,9)> 3) <(4,5), (2,8), (1,7), (3,6)> 4) <(7,8), (1,2), (5,6), (3,4)>
Consider DFS over undirected graph with 4 vertices <A;B;C;D>. The discovery and finishing times of them in the order A to D are given. Select the option from following sh...