75 |
triangle |
triangle |
76 |
}; |
}; |
77 |
|
|
78 |
|
/* Structure for colorentries. */ |
79 |
|
struct colorentry_s |
80 |
|
{ |
81 |
|
int color_index; |
82 |
|
int red_cp; |
83 |
|
int green_cp; |
84 |
|
int blue_cp; |
85 |
|
struct colorentry_s *next; |
86 |
|
}; |
87 |
|
|
88 |
/* Structure to construct lists of classnames. */ |
/* Structure to construct lists of classnames. */ |
89 |
struct classname_s |
struct classname_s |
90 |
{ |
{ |
93 |
struct classname_s *next; /* next name class association. */ |
struct classname_s *next; /* next name class association. */ |
94 |
}; |
}; |
95 |
|
|
96 |
|
/* Structure is in infoname. */ |
97 |
|
struct infoname_s |
98 |
|
{ |
99 |
|
int integer; |
100 |
|
char *string; |
101 |
|
struct infoname_s *next; |
102 |
|
}; |
103 |
|
|
104 |
/* Layout Algorithms which can be found in VCG. |
/* Layout Algorithms which can be found in VCG. |
105 |
Details about each algoithm can be found below. */ |
Details about each algoithm can be found below. */ |
106 |
enum layoutalgorithm_e |
enum layoutalgorithm_e |
577 |
Defalut is box, other: rhomb, ellipse, triangle. */ |
Defalut is box, other: rhomb, ellipse, triangle. */ |
578 |
enum shape_e shape; |
enum shape_e shape; |
579 |
|
|
580 |
/* FIXME {vertival,horizontal}_order */ |
/* Vertical order is the level position (rank) of the summary node of an |
581 |
|
inner subgraph, if this subgraph is folded. We can also specify |
582 |
|
level: int. The level is only recognized, if an automatical layout is |
583 |
|
calculated. */ |
584 |
|
int vertical_order; |
585 |
|
|
586 |
|
/* Horizontal order is the horizontal position of the summary node within |
587 |
|
a level. The nodes which are specified with horizontal positions are |
588 |
|
ordered according to these positions within the levels. The nodes which |
589 |
|
do not have this attribute are inserted into this ordering by the |
590 |
|
crossing reduction mechanism. Note that connected components are |
591 |
|
handled separately, thus it is not possible to intermix such components |
592 |
|
by specifying a horizontal order. If the algorithm for downward laid |
593 |
|
out trees is used, the horizontal order influences only the order of |
594 |
|
the child nodes at a node, but not the order of the whole level. */ |
595 |
|
int horizontal_order; |
596 |
|
|
597 |
/* xmax, ymax specify the maximal size of the virtual window that is |
/* xmax, ymax specify the maximal size of the virtual window that is |
598 |
used to display the graph. This is usually larger than the displayed |
used to display the graph. This is usually larger than the displayed |
663 |
By default, no class names. */ |
By default, no class names. */ |
664 |
struct classname_s *classname; |
struct classname_s *classname; |
665 |
|
|
666 |
/* FIXME : infoname. */ |
/* Infoname allows to introduce names for the additional text labels. |
667 |
/* FIXME : colorentry. */ |
The names are used in the menus. |
668 |
|
Infoname is given by an integer and a string. |
669 |
|
The default value is NULL. */ |
670 |
|
struct infoname_s *infoname; |
671 |
|
|
672 |
|
/* Colorentry allows to fill the color map. A color is a triplet of integer |
673 |
|
values for the red/green/blue-part. Each integer is between 0 (off) and |
674 |
|
255 (on), e.g., 0 0 0 is black and 255 255 255 is white. For instance |
675 |
|
colorentry 75 : 70 130 180 sets the map entry 75 to steel blue. This |
676 |
|
color can be used by specifying just the number 75. |
677 |
|
Default id NULL. */ |
678 |
|
struct colorentry_s *colorentry; |
679 |
|
|
680 |
/* layoutalgorithm chooses different graph layout algorithms |
/* layoutalgorithm chooses different graph layout algorithms |
681 |
Possibilities are maxdepth, mindepth, maxdepthslow, mindepthslow, |
Possibilities are maxdepth, mindepth, maxdepthslow, mindepthslow, |