at least one processor; and

computer memory having computer-readable instructions embodied thereon that when executed by the at least one processor perform operations comprising:

for the plurality of users, each user having corresponding user data characterizing the user, programmatically evaluating the user data for each pair of users in the plurality to determine whether at least one relationship exists between the pair of users, thereby forming a set of user-pair relationships for the pairs of users determined to have at least one relationship existing between the pair;

based on the set of user-pair relationships, generating a graph data structure comprising a plurality of nodes and one or more edges connecting each node to another node, each node corresponding to a user in the set of user-pair relationships, and each edge corresponding to a relationship of one of a plurality of relationship types existing between users corresponding to the nodes that are connected by the edge;

detecting an interaction between a first user and a graphical user interface (GUI) element displayed on a user interface of a communication application, the GUI element identifying a second user;

in response to detection of the interaction, querying the graph data structure to identify connection data describing a path within the graph data structure that extends between a first node corresponding to the first user and a second node corresponding to the second user, the connection data identifying: