A social media application wants to find the shortest chain of connections between two users (e.g., 'friend of a friend').
If the network is represented as an unweighted graph where users are nodes and friendships are edges, which algorithm is most suitable for this task?
