Matrix operation-based method for modifying mobile social network graph

A matrix operation-based method for modifying a mobile social network graph, comprising the following steps:

• step S1:
• obtaining an accessibility matrix set A of a social network graph to be modified;
• step S2:
• determining information to be modified for each node in the social network graph to be modified, and creating a List to be modified;
• step S3:
• for each node in the social network graph to be modified, determining whether edge adding is required according to the List to be modified;
• if the edge adding is required, sequentially determining whether there are nodes requiring the edge adding in a two-hop neighbor to a five-hop neighbor according to the accessibility matrix set;
• if there are nodes requiring the edge adding in the two-hop neighbor to the five-hop neighbor, adding an edge between two nodes, and updating values of the two nodes in the List to be modified;
• and if adding an edge does not make the current node value zero in the List, skipping the node, and continuing to search for nodes requiring edge adding in the List;
• and
• step S4:
• if there is still a non-zero value in the List after all nodes are traversed, directly adding Max(List) nodes to a network, and randomly performing edge connection between the added nodes and nodes still requiring edge adding, so that all values in the List are zero, thereby completing graph modification.