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 <[email protected]> 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 [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. > -- 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.
