How can i build different component?

#1

how can i build different component from given edges??

#2

Let u be a vertex and v be its child. Then, check if children[v]>children[u].This way, check for each vertex while traversing the graph in DFS. One important thing to note that actually there are many trees in the input(a graph with no cycles and self loops is a tree). That means , you have to apply DFS for each of these trees.

#3

but how can i decide master parent then enter in arraylist??

#4

go through this code once to understand:

#5

there is no need to decide which is master parent??
and can i solve it without using node class(given in above code)??

#6

yes and you could define a class graph instead with the needed functions

#7

i mean can i solve without these features , any another way to solve it, i don’t want to know can i replace the name node to graph or not.

#8

i dont mean the name changing bro. i mean define a class graph
something along these lines

1 Like