0 votes 0 votes Consider the following graph: The number of strongly connected components of the graph are ________. Algorithms algorithms graph-algorithms made-easy-test-series + – syncronizing asked Sep 15, 2018 • retagged Jan 2 by Hira Thakur syncronizing 2.5k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Shaik Masthan commented Jan 9, 2019 reply Follow Share read the concept https://www.geeksforgeeks.org/strongly-connected-components/ 0 votes 0 votes srestha commented Sep 23, 2019 reply Follow Share @Shaik Masthan tell me one thing, how A is strongly connected component?? No incoming edge for A, right?? 0 votes 0 votes Shaik Masthan commented Sep 24, 2019 reply Follow Share a graph with one vertex is always connected due to there are no other vertices which are not reachable from it. In the same way, a graph with one vertex always strongly connected component. Read the link which was provided by me for more info. 1 votes 1 votes Please log in or register to add a comment.
