1 votes 1 votes What are the strongly connected components in the above figure ? Algorithms algorithms graph-algorithm normal cormen + – Doraemon asked Mar 30, 2019 retagged Jan 7 by Hira Thakur Doraemon 737 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply jat.gaurav commented Mar 30, 2019 reply Follow Share A strongly connected component of a directed graph is a maximal strongly connected subgraph 1. svw 2. qty 3. xz 4. r 5. u 1 votes 1 votes ankitgupta.1729 commented Mar 30, 2019 reply Follow Share https://gateoverflow.in/3589/gate2006-it-46 you can check the above question for more info how to find strongly connected components using algorithm or intuitively. 1 votes 1 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes 5 stronglly component. abhishekmehta4u answered Mar 30, 2019 selected Mar 30, 2019 by Doraemon abhishekmehta4u comment Share Follow See all 3 Comments See all 3 3 Comments reply Doraemon commented Mar 30, 2019 reply Follow Share @abhishekmehta4u Using Kosaraju's Algorithm 1> step find the DFS of G.and store their finishing time 2>compute Transpose of G and after that perform DFS of Transpose of G and then perform then perform the traversal in such a way that for each node the adjacent nodes should be visited in decreasing order of their finishing time. And we are comparing the number of connected components in the 2 graphs G and $G^{T}$ right?? 1 votes 1 votes abhishekmehta4u commented Mar 30, 2019 reply Follow Share Yes you are right. 0 votes 0 votes Hira Thakur commented Nov 14, 2019 reply Follow Share how many cross edges and forward edges are present in the above graph?? 1 votes 1 votes Please log in or register to add a comment.