Design Friend Recommendations for a Large Friendship Graph

You are designing the recommendation component for a social network. The input is an undirected graph with up to 120,000 users and up to 1,800,000 friendship edges. For any requesting user, the system should return a small ordered list of candidate new connections. Your job is to define and justify the full algorithm: the eligibility rule (who may be recommended), the scoring and ranking policy, the candidate generation procedure, and the method for selecting the top…