Method for positioning nodes of undigraph

Abstract

The invention relates to a method for positioning nodes of an undigraph. The method comprises the following steps: (1) identifying all cut edges; (2) selecting a group which has the biggest dimension and enables the number of layers of a group tree to be least from the group tree as a root of the group tree; and (3) separating the rectangular region into a plurality of layers from the top to the bottom, wherein the step (3) further comprises the following steps: positioning the group at a corresponding block from the left to the right according the sequence of the group in the same layer of the group tree; judging whether the group comprises only one node or not; positioning the only node at the center position of the corresponding block if the group comprises the only node; if the group does not comprise the only node, identifying all cut points in the group, decomposing the group into subgroups, separating the subgroups into sublayers from the top to the bottom and separating each sublayer into a plurality of subblocks from the left to the right; and distinguishing the subgroups from the cut points and correspondingly positioning the subgroups and the cut points. According to the method provided by the invention, the intersecting, the far-crossing and the superposition of connecting lines in the undigraph are reduced to the maximum, and the node grouping condition and the connecting line organizing condition of the undigraph are clear and legible.

Description

Technical field [0001] The present invention relates to the technical field of information visualization, in particular to the technical field of undirected relation graph display, drawing and visualization. Background technique [0002] In computer science and technology, describing the relationship between a group of objects is often represented by undirected graphs, and the form of obtaining such relationship information is often the logical representation of undirected graphs, such as tables, databases, and adjacency matrices. This logic Representation is very unintuitive, so people like to re-represent it with a graph on a plane. The node representing the object is represented by a dot or small circle, and the logical relationship between the objects is represented by a line segment connecting the two nodes. This kind of graphical representation is intuitive, but there is a problem: if the position of the node is not placed properly at the beginning, the result of crisscross...

AI Technical Summary

Problems solved by technology

This kind of graphical representation is intuitive, but there is a problem: if the position of the nodes is not placed well at the beginning, the result of criss-crossing will be produced when drawing the connecting lines, the relationship between the drawn graphs is not clear, and the connecting lines will cross, span or overlap

[0004] The deterministic node positioning method includes the elastic model method (Eades, P..A Heuristic for Graph Drawing. Congressus Numerantium, No.42, 1984: 149-160), which is easy to fall into a local optimal solution

Randomization methods include genetic algorithm (Zhang Qingguo et al.: Drawing undirected graphs with genetic algorithm. Computer Engineering and Science, 28(6), 2006: 58-61; Huang Jingwei et al.: Binary tree drawing algorithm based on genetic algorithm. Journal of Software, 11(8), 2000: 1112-1117), simulated annealing algorithm (Davidson, Ron; Harel, David. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, Vol.15, No.4, 1996: 301-331) etc. They belong to the evolutionary algorithm, and the disadvantage of the evolutionary algorithm is that the algorithm converges slowly and the result is uncertain

Images