Research On Graph Layout Algorithm In Network Environment

Graph is a conceptual tool that is used to abstract structured data into nodes and edges.Now graph has been widely used in various fields,such as biology,communication network,social network and so on.Based on the powerful visual processing capabilities of human,graph visualization could help users understand data more quickly.Among all the visual representations of graph,node-link diagram is the most universal.Various types of layout algorithms for node-link diagram have been developed to handle different tasks.However,as the network occupies a growing proportion of people's lives,these layout algorithms face a common problem: how to deal with large-scale and time-series data.A considerable amount of work has been done to solve large-scale graph layout problems,or dynamic graph layout problems,but few of them can cope with large-scale and time-series data.In addition,for the layout tasks of different fields,while processing large-scale data,it also needs appropriate expressions because of different goals.Therefore,the main contribution of this paper is to propose a graph layout algorithm to deal with large-scale and time-series data.The algorithm is applicable to graphs of multi-connected components and high cohesive low-coupling type structures.It can adapt to large-scale data,and can complete the layout in a short time and keep the general structure of the graph stable when the data changes dynamically.In addition,for the data of three different fields,this paper designs graph layout algorithms with different expressions to deal with their respective tasks.In the formal verification of data flow diagram task,the hierarchical form graph layout algorithm is designed to represent the state transition graph of the system and the comparison process of the state space.In the network situation analysis task,the collocation pattern layout algorithm is designed to represent and compare the distribution of packet traffic on different protocols in different time periods.In the exploration of the pseudo base station distribution task,a Sanki diagram is used to show the distribution of pseudo base stations and spam messages.Overall,this paper mainly addresses the layout problem of large-scale time series data and the visualization of graphs for specific tasks in three different fields.