Please check code for beautiful vertices problem

#1


Can you tell for which test case my code is failing.

#2

hello @sahilkhan2312000131

In backend ur score for this problem is 100 , is it still showing wa?

#3

I did the quetion using dfs and got correct answer but I want to know why this approach is wrong??

#4

ur logic is correct.

the issue is with the constrcution of graph.
u r assuming that if x–y edge is given then x will be the parent of y.
which is wrong.
the parent and child will be decided by the least value of that component.

for example->
3–4--1 (they all are in a single component)

here 1 is least value so 1 is master parent.
and its child will be 4. and 4 child will be 3
so parent- child graph should be like this->
1 --> 4–>3

#5

i get that 1 is master parent as its smallest value of this component. but how is 3 a child of 4??

#6

1 is master parent.
so all its negibhour will be its child (4)

and similary all neigbhours of 4 will be its child ( 3 ).
so on… till u reach leaf

#7

In the hint video of this question, it is given then for graph: 2–3--1
the directed graph becomes: 1–>2–>3
Which I think is wrong. Shouldn’t it be: 1–>3–>2

#8

…

yeah , it should be 1–>3–>2
there is no edge between 1 and 2 so that is not correct

#9

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.