Articulation Pair

Revision en1, by vkditya0997, 2015-12-12 20:32:49

I solved this by a brute force
By removing each and every pair, if no of connected components are greater than initial no , count ++
But it was very lengthy, and I saw many short codes, Which I couldn't understand?
Any optimized Algorithm to solve these kind of problems?
Thanks in advance !


  Rev. Lang. By When Δ Comment
en1 English vkditya0997 2015-12-12 20:32:49 401 Initial revision (published)