I am stuck on this following problem:
Given an undirected connected simple graph of n nodes and m edges, for each node i from 1 to n you need to find if this node was not present in this graph how many connected components the graph would have.
4 4 //4 nodes and 4 edges
1 2 1 1
A node is not present means erasing the node and its edges
Thanks for reading the problem. It will be really helpful if you can give me a solution.