PURPOSE: To remove the partiality of node positions in graph structure by encircling the whole graph structure with a rectangle and forming this rectangle of n2 small rectangular areas, varying the area of each small rectangular area according to the number of nodes included in the small rectangular area, transforming the coordinate system of the small rectangular areas before the deformation the coordinate system of small areas after the deformation and automatically arranging the nodes. ;CONSTITUTION: The whole graph structure is encircled with the rectangle, which is equally divided by (n) in an (x) and a (y) direction into n2 small rectangular areas. A small rectangular area in an (i)th row from the top and a (j)th column from the left is denoted as Bij. For example, a small rectangular area B23 in the 2nd row from the top and 3rd column from the left is shown by 401. Then nodes in each small rectangular area are counted. Consequently, the numbers of nodes included in the respective small rectangular areas can be calculated in a linear time. Then the respective small rectangular areas are varied in area without changing their contiguity relation so that the area is proportional to the number of nodes. Namely, each small rectangular area is given area which is proprotional to its number of nodes, so that the nodes are equally distributed.;COPYRIGHT: (C)1995,JPO
展开▼
