0 votes 0 votes How to solve such problems? Graph Theory made-easy-test-series discrete-mathematics graph-theory + – Kalpataru Bose asked Dec 26, 2017 edited Mar 7, 2019 by Aditi Singh Kalpataru Bose 573 views answer comment Share Follow See 1 comment See all 1 1 comment reply Pawan Kumar 2 commented Dec 26, 2017 reply Follow Share is it 4 ? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 4 is biconnected components Rackson answered Jan 19, 2019 Rackson comment Share Follow See 1 comment See all 1 1 comment reply balchandar reddy san commented Jan 22, 2019 reply Follow Share Solution please? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes i think it is saying to find no. of strongly connected components. so we can apply kosaraju algorithm which will give correct result. royal shubham answered Jan 22, 2019 royal shubham comment Share Follow See 1 comment See all 1 1 comment reply royal shubham commented Jan 22, 2019 reply Follow Share yes 4 should be correct ans. becauuse there is 3 articulation point. 0 votes 0 votes Please log in or register to add a comment.