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.
