Edge-Weighted Anonymity for Directed Network Graph

In social networks, weighted graph anonymity is gaining more and more attention. But fan-following graphs like Twitter's are not protected by anonymity. Privacy protection based on directed graphs should arouse everyone's importance, thus it requires effective anonymization techniques. In this paper, we propose a directed edge weighted graph anonymity scheme to model the shortest path in a directed network graph by Floyd algorithm and Dijkstra algorithm. Also, we execute the experiments on the number of anonymity solutions and time with different edge weights to verify their anonymity feasibility. Finally, we analyze the anonymity of two algorithms and to some extent concluded that Floyd algorithm is more suitable for anonymity of directed network graphs.