how to find strongly connected component
plz provide pocedure
By definition :- In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex.
Now from the given graph look at vertex set that have cycles. If it has cycle than it is sure that the given any vertice can reach any other vertice of it's component.(mind well we are only concerned about the component itself and not the entire graph.) Just follow the procedure with your observationa and get the number of components. Leave those vettices that do not participate in any strongly connected component. it will be treated as individual component...