Abstract:

A visually clarifying display algorithm for undirected relation graphs is proposed in this paper. Given an ordinary undirected relation graph, after it is processed by the novel algorithm determining the new positions of the vertices, it becomes more clear in aesthetic criteria. First, for a given graph, any isolated vertices are deleted, all the connected branches are decomposed. For each connected branch, it is decomposed into several cliques linked as a tree via recognizing the cut edges (bridges). Then the cliques are decomposed into several subcliques via recognizing the cut vertices. Finally, the vertices in the subclique are uniformly located in a circle. The algorithm is featured with convenient implementation, simple model, fast processing, clear output results and easy parallelization.

Key words: undirected graph;clarifying display;cut edge;cut vertex;clique