A Three-Level Force-Directed Layout Algorithm Based on PageRank and Simulated Annealing

How to avoid visual confusion and effectively display network structure and features in network data analysis is a problem that has long plagued network visual analysis. The classical force-directed layout algorithm chooses a random layout for the initial layout, which leads to a high number of edge crossings and long layout time. In this paper, we design a three-level pre-positioning layout strategy based on a variant of the PageRank algorithm and an improved simulated annealing algorithm to achieve the division of node levels and layout positions. And we improve the cooling function in FR algorithm to further reduce layout time to complete the final layout. The experimental results show that compared with the classical algorithm, the algorithm in this paper can reduce the number of edge crossings as well as the iteration time of the algorithm, and effectively generate a high-quality network graph layout.