4 4 votes Consider the following graph (G): How many strongly connected components are there in the above graph? Graph Theory graph-theory + – worst_engineer 10.8k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 9 9 votes Answer is 5. A directed graph is strongly connected if there is a path between all pair of vertices. A-B-F-C E D G H so totally 5 priyavssut answered Dec 29, 2015 • selected Dec 29, 2015 by worst_engineer priyavssut comment Share Follow See all 6 Comments 6 6 Comments reply Show 3 previous comments srestha commented Dec 29, 2015 reply Follow flag http://www.geeksforgeeks.org/strongly-connected-components/ 1 1 replyShare priyavssut commented Jan 3, 2016 reply Follow flag @ coolcoder001 we can say E,D,G,H are the trivially connected to it self so each individual nodes are itself strongly connected components. 2 2 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag I think $E, D, G, H$ have strongly connected because the set of a strongly connected component not containing these elements. see this example: In this Example {A},{B},{C},{D},{E},{F},{G}are strongly connected components. 0 0 replyShare Please log in or register to add a comment.
