@Mani  Good Analysis .. SO in that case if there more then one path exist 
we wants to to find path of maximum length , because we wants to show 
maximum friends which are mutual between A & D , isn't it makes clear . so 
till we have only discussed about the designing part & some approaches 
,,not the complexity also do you think Facebook uses these to solve the 
same problem ? 


Thanks
Shashank Mani Narayan
Computer Science
Birla Institute of Technology Mesra 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/RR2UBVsCbRAJ.
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.

Reply via email to