735 views
4 votes
4 votes

1 Answer

0 votes
0 votes
A. S isn't part of PQR component.

B. Q -> R, but then P and S are separate component.

D. For Q its (1,2) it means it isn't connected to any other vertex.

For C: Start with R then Q (start time 2), S (start time 3), then P (start time P). So graph is connected. As its undirected graph we don't need to worry about direction of edges.

C is correct.

Related questions

1 votes
1 votes
0 answers
3
3 votes
3 votes
0 answers
4
Na462 asked Aug 21, 2018
1,306 views
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack s...