I have no idea on what the 1st question is about as i have never used orkut... 1. Regarding the 2nd one. Maintain a adjacency list for both the user's friends. 2. Move through the friends of user 1 and mark them grey. 3. Move through the user 2 friends and mark them grey if not marked and mark them black if already grey. Finally traverse any 1 user's friends and pick out the black nodes
On Jul 26, 4:56 pm, WgpShashank <shashank7andr...@gmail.com> wrote: > if geeks are Really Interested in Application of Graph then why not start > from Now :) > > 1. if you click on any orkut member's name you will notice the relationship > for both of you indicating through whom you are interconnected or in certain > cases you won't get this path. if you have to propose algorithm what would > be the one ... > > 2 . find the all common friends of between two friends in two friends. > > Will try to reply asap once it generated good discussion :) > > Shashank Mani > Computer Science > Birla Institute of Technlogy,Mesra -- 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.
