@dufus i read this ques from somewhere . dont know wat the examiner is looking for...
i think it mite work,, On Tue, Sep 8, 2009 at 8:38 PM, manish bhatia <mb_mani...@yahoo.com> wrote: > how about finding all the connected-components and checking which all have > 3 edges? > > ------------------------------ > *From:* ankur aggarwal <ankur.mast....@gmail.com> > *To:* "i...@mca_2007" <iit_rmca_2...@googlegroups.com>; > lets-talk-g...@googlegroups.com; algogeeks@googlegroups.com > *Sent:* Sunday, 6 September, 2009 2:58:40 PM > *Subject:* [algogeeks] find triangle in a graph > > google question : find triangle in a graph Given an undirected graph, > design a O(V+E) algo to detect whether there is a triangle in the graph ot > not. > > ------------------------------ > Looking for local information? Find it on Yahoo! > Local<http://in.rd.yahoo.com/tagline_local_1/*http://in.local.yahoo.com/> > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
