@mohit : i disagree.. precisely bcoz of the reason you cited we can only check common nodes between cycles and nothing else .. please correct me if i am wrong
On Wed, Aug 31, 2011 at 9:34 PM, mohit verma <mohit89m...@gmail.com> wrote: > @ MAC , i think it was not right to inspect common nodes in different > cycles. > > say in the above picture the two inner nodes of inner cycle are out side > the bigger cycle (towards A) then co-ordinates of the inner cycle will > change and no cycle nested but having common nodes. > > > On Wed, Aug 31, 2011 at 9:13 PM, MAC <macatad...@gmail.com> wrote: > >> it was loops sharing common edges ,, (i said find all cycles and see if >> there is some cycles having coomon nodes between them and he was not happy >> ) >> >> >> >> On Wed, Aug 31, 2011 at 8:54 PM, Piyush Grover <piyush4u.iit...@gmail.com >> > wrote: >> >>> loop within a loop, what exactly that means?? >>> Nee to consider the planarity or two loops sharing common edge/s?? >>> >>> >>> On Wed, Aug 31, 2011 at 8:46 PM, MAC <macatad...@gmail.com> wrote: >>> >>>> Q The question asked in interview of a startup : suppose you have a >>>> graph as shown bellow : please see the attachment . The red dots are graph >>>> vertexes ( you can see 1 vertex alone , aloof ) >>>> so you can see there are 2 cycles one inside another . How will you >>>> find such a scenario in a graph i.e. a cycle within a cycle. >>>> >>>> When i couldn't answer he asked how will you find strongly conected >>>> components of a graph (since it was follow up it MIGHT be related to >>>> solution but thought its good to share ) >>>> >>>> >>>> any thoughts on these 2 questions >>>> -- >>>> thanks >>>> --mac >>>> >>>> -- >>>> 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. >>>> >>> >>> -- >>> 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. >>> >> >> >> >> -- >> thanks >> --mac >> >> -- >> 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. >> > > > > -- > ........................ > *MOHIT VERMA* > > -- > 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. > -- thanks --mac -- 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.
