Graph visualization method and system based on ring constraint and stress model

Abstract

The invention provides a graph visualization method and system based on a ring constraint and stress model; the method comprises the steps: receiving graph data, and obtaining the initial layout of the graph data; receiving interested nodes selected for the initial layout of the graph data and a set neighbor range, and selecting interested sub-graphs according to the interested nodes; carrying out layout optimization on the sub-graph based on a stress model with ring constraints; and identifying edges and end points, end points and end points, crossed edges and overlong edges meeting set conditions in the optimization result, and adjusting the layout by adjusting related parameters to obtain a visual layout result.

Description

technical field [0001] The disclosure belongs to the technical field of data visualization, and in particular relates to a graph visualization method and system based on ring constraints and stress models. Background technique [0002] The statements in this section merely provide background information related to the present disclosure and do not necessarily constitute prior art. [0003] Among data visualization techniques, individual-centered network visualization has received extensive attention in recent years. Individual-centered networks are of great significance in the study of social networks, especially when it is necessary to study the relationships of important people in social networks. When researchers do not study the network as a whole, but focus on the social nature of individuals, the role of individual-centered networks is more obvious. For example, common user relationship topology diagrams are all individual-centered networks. By observing the individ...

AI Technical Summary

Problems solved by technology

[0008] Some of these existing radial layout methods only allow nodes to be laid out on specified circles, which results in layout results that can only be presented in one-dimensional space, and the clustering structure between nodes is difficult to represent

There are also some nodes that do not restrict the nodes to be on the specified circle, but it is not strictly stipulated that the same-level nodes with the same distance from the central node must be in the same range, which makes it easy for users to misunderstand the relationship between these nodes and the central node.

At present, there is no method that can not only ensure that the nodes of the same layer are in the same range, but also show the clustering structure between nodes.

Images