The Fake Geek's blog: Breadth first search using Distributed System
How would you design the data structures for a very large social network (Facebook, LinkedIn, etc)? Describe how you would design an algorithm to show the connection, or path, between two people (e.g., Me -> Bob -> Susan -> Jason -> You).
This problem is from the Cracking code interview. However, I saw a video on YouTube about how to use distributed system (MapReduce) to do Breadth first search. So I guess that would be a good answer.
Read full article from The Fake Geek's blog: Breadth first search using Distributed System
No comments:
Post a Comment