+1 vote
53 views

What are the strongly connected components in the above figure ?

recategorized | 53 views
+1

strongly connected component  of a directed graph is a maximal strongly connected subgraph

1. svw

2. qty

3. xz

4. r

5. u

+1

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.

5 stronglly component.

by Boss (35.7k points)
selected by
+1

@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??

0
Yes you are right.
0
how many cross edges and forward edges are present in the above graph??

2