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. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
