@jitesh rightly said... since there is no limit of depth... we can go for BFS..
we can reduce space by comparing A's and C's profile... whatever is common ... we can use it to find connection... between A and C ........ With regards, Praveen Raj DCE-IT 3rd yr 9999735993 [email protected] On Wed, Sep 14, 2011 at 4:31 PM, JITESH KUMAR <[email protected]> wrote: > Using DFS we can stuck in the blind ally as there is not limit of depth.. > > > On Wed, Sep 14, 2011 at 4:16 PM, tech coder <[email protected]>wrote: > >> we can also use dfs and find if there exist path between given two >> nodes(profiles here). >> if yea , there is a connection b/w two profiles. >> >> >> On Wed, Sep 14, 2011 at 1:58 PM, Azhar Hussain <[email protected]>wrote: >> >>> Union Find Algorithm would do >>> >>> - >>> Azhar. >>> >>> >>> On Wed, Sep 14, 2011 at 1:42 PM, JITESH KUMAR <[email protected]>wrote: >>> >>>> Neither depth is known nor we have to find the shortest path. We just >>>> have to find the path. >>>> >>>> >>>> -- >>>> *Regards >>>> Jitesh Kumar >>>> * >>>> >>>> -- >>>> 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. >>> >> >> -- >> 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. >> > > > > -- > *Regards > Jitesh Kumar > > "There is only one 'YOU' in this world. You are Unique and Special. > * > *Don't Ever Forget it."* > > -- > 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.
