FAILURE - Editorial

[didgogns]

My approach was to calculate number of connected components after deleting each vertex. If after deleting a vertex, connected Components + #Edge = vertex (=N-1), then there is no cycle left and the vertex is point of failure.

Number of connected components while removing an articulation point

I want to calculate number of connected components an articulation/cut vertex generates while removing it. I am calculating it as number of children +1 in dfs tree of the graph( for root, number of children only if cut vertex). Am I correct? If not, then what is the correct algorithm? I am getting wa repeatedly for this problem.

This discussion helped a lot!