I think we could use Algorithm A* where in subgraph(G) maintains all the paths to the required profile and subtree(Tr) gives us the optimal path......
On Tue, Sep 13, 2011 at 5:43 PM, JITESH KUMAR <jkhas...@gmail.com> wrote: > Suppose you are visiting someone's profile in fb or linkedin, you get to > know how you are connected to that person. > e.g. Suppose you are visiting C's profile. you get a suggestion like you > are connected to him via A->B->C. > Tell efficient way to solve this problem( apart from Brute Force). > > -- > *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 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.
