search
Log In
1 vote
86 views

Better Explanation??

in DS 86 views
0
answer should be B) introduce a start vertex T and it forms a tree (T->Q->R | T->P | T->S)

1 Answer

0 votes
C is the correct answer.

Related questions

2 votes
0 answers
1
272 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 simultaneously are ......... Ans. 10
asked Aug 21, 2018 in DS Na462 272 views
4 votes
1 answer
2
0 votes
0 answers
3
264 views asked Nov 7, 2018 in Programming Na462 264 views
1 vote
1 answer
4
...