2. The method of claim 1 , further comprising: accessing, by one or more computing devices, a graph data structure comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them.
2. The method of claim 1 , further comprising: accessing, by one or more computing devices, a graph data structure comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them. 4. The method of claim 2 , wherein the first user corresponds to a first node of the plurality of nodes, and wherein the one or more second users correspond to one or more second nodes of the plurality of nodes, respectively, each second node being connected to the first node by an edge.