finding the shortest path between A and C nodes , gives required solution . We can use dijkstra's algorithm to find the shortest path ..
On Tue, Sep 13, 2011 at 5:43 PM, JITESH KUMAR <[email protected]> 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 [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 , P Veera Reddy Devagiri Senior Under Graduate Computer Science and Engineering IIIT Hyderabad Mobile no-+91-9492024783 -- 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.
