@Rohit : i may be the decendant node of node j. initially DFS iteration starts from node i, if decendant's condition occur then mark edge (i,j) as back edge. (here j is the node which may be not visited).
-- 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.
