in DS
1,249 views
3 votes
3 votes
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
in DS
by
1.2k views

4 Comments

minipanda what if i take 2 K5 in graph since it is not asking simple connected graph , but you answer assume this .
0
0

Anu007 Sir though I didn't think it in this way earlier but then we can take infinitely many no. of K5 in the graph to maximize the no. of edges..but the answer should be some finite one..so this assumption can be safely made..Please correct me

0
0

@Anu007, sir 

in the question they mentioned DFS, if it is really disconnected the term would be replace by DFT

0
0

Please log in or register to answer this question.

Related questions

4 votes
4 votes
1 answer
2
budhu asked in DS Jan 25, 2018
696 views
budhu asked in DS Jan 25, 2018
by budhu
696 views
0 votes
0 votes
0 answers
3