checking a loop in graph can be done by DFS. On 4/23/12, Anshul Gupta <anshulgupta.i...@gmail.com> wrote: > There could be finite number of paths between source and destination even > if there is a loop in the graph, you need to check if there is a loop which > lies on a path from source to destination > > Anshul Gupta > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > >
-- **Regards * * <bagana.bharatku...@gmail.com> Bharat B | M.Tech II | C.S.E | IITM * * *Ph: +91 8056127652* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
