Determining membership in a social graph

摘要

A method for determining membership/follower status in a social network is provided. Outgoing edge data and anti-outgoing edge data of a first user are read. A second user is determined to be a member of the first user's social graph when the second user is designated in the outgoing edge data and not designated in the anti-outgoing edge data of the first user. In another implementation, a method for removing a second user from a social graph of a first user is provided. A designation of the second user is removed from outgoing edge data of the first user, and a designation of the first user is removed from incoming edge data of the second user. A designation of the first user is added to anti-outgoing edge data of the second user, and a designation of the second user is added to anti-incoming edge data of the first user.

主权项

1. A method, comprising:
receiving a request from a first user to remove a second user from a first social graph of the first user on a social network, the second user being different from the first user; receiving, by a processing device, first social graph data associated with the first social graph of a first user account of the first user and second social graph data associated with a second social graph of a second user account of the second user; in response to the request from the first user, updating, by the processing device, the first social graph and the second social graph data to remove a connection between the first user and the second user on the social network, wherein the updating comprises:
removing, by the processing device, a designation of the second user from outgoing edge data of the first user in the first social graph data, wherein the outgoing edge data of the first user indicates that the second user is a member of the first user's social graph provided that the second user is not also designated in anti-outgoing edge data of the first user in the first social graph data, wherein the anti-outgoing edge data is associated with the outgoing edge data, and wherein the outgoing edge data and the anti-outgoing edge data are different sets of data; andremoving, by the processing device, a designation of the first user from incoming edge data of the second user in the second social graph data, wherein the incoming edge data of the second user indicates that the first user has added the second user to the first user's social graph provided that the first user is not also designated in anti-incoming edge data of the second user in the second social graph data, wherein the anti-incoming edge data is associated with the incoming edge data, and wherein the incoming edge data and the anti-incoming edge data are different sets of data; and preventing, based on the outgoing edge data, anti-outgoing edge data, incoming edge data, and anti-incoming edge data, an addition of the first user to the social graph of the second user.