@piyush : what do u mean by " let node j be the 1st node not visited"? or are u foretting the cross edges? -------------------------------------------------- Rohit Saraf Second Year Undergraduate, Dept. of Computer Science and Engineering IIT Bombay http://www.cse.iitb.ac.in/~rohitfeb14
On Sun, Jun 20, 2010 at 9:11 PM, Piyush Verma <[email protected]> wrote: > if ur vertex is node i then do > DFS-iteration for node i > let node j be the 1st node not visited > if node j was already visited by DFS then mark edge (i,j) as 'back > edge' > other wise mark it as 'tree edge' > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
