do dfs on graph and then do dfs on transpose of the graph(just reverse the edges that is transpose) in order of decreasing order of finishing time of vertices.
the number of vertices you need to apply dfs on second time will be number of strongly connected components. On Mon, Jul 19, 2010 at 6:44 PM, Piyush Verma <114piy...@gmail.com> wrote: > how to find strongly connected components in a graph? > plz explain the method of DFS of G and DFS of complement of G and how > second DFS is related to first. > > > give any other idea if anyone has.... > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- With Regards, Jalaj Jaiswal +919026283397 B.TECH IT IIIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
