How can I convert

#1

Can anyone pls tell me how to convert the graph to a graph with minium edge as parent???

#2

sorry it would be minimum vertex not edge…

#3

Hey @soumakpoddar55
You just need to find connected components in graph
In your code start finding if a node is visited from 1 to N
The node which is unvisited from which you start dfs for a new component will always be minimum vertex of component